{"id":"W6966557460","doi":"10.4230/lipics.sand.2025.12","title":"Restless Exploration and Token Dissemination in Vertex-Permuted Temporal Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Security token; Graph; Vertex (graph theory); Class (philosophy); Topological graph theory; Graph property; Base (topology)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001382388,0.0005439589,0.0006237931,0.0006994018,0.001083813,0.001494695,0.001336788,0.0009786199,0.002651049],"category_scores_gemma":[0.009412314,0.0003756353,0.0007648793,0.00130384,0.001703713,0.00539191,0.001827013,0.001244349,0.0002990978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001373422,"about_ca_system_score_gemma":0.0009392577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001986867,"about_ca_topic_score_gemma":0.001717417,"domain_scores_codex":[0.9988157,0.0004625921,0.00006616781,0.0002710475,0.0001797734,0.0002047416],"domain_scores_gemma":[0.9923962,0.004987511,0.0008843876,0.001044417,0.0003496662,0.000337775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006823677,0.0001075558,0.001333641,0.0002565299,0.00006606154,0.0006391005,0.0006798286,0.4193939,0.008800921,0.5223587,0.004835471,0.04084592],"study_design_scores_gemma":[0.00005667429,0.00008827255,0.0003288527,0.00002500674,0.00003409633,0.0002847045,0.0001969551,0.6618344,0.004147325,0.3268706,0.006107703,0.00002538446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1060393,0.0004320652,0.8854681,0.0007937567,0.00005485907,0.0001168746,0.0004176522,0.0004514183,0.006225873],"genre_scores_gemma":[0.8753824,0.0006402366,0.116857,0.0001995364,0.00006829926,0.0001719088,0.0004826728,0.0001563711,0.006041817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002651049,"threshold_uncertainty_score":0.009964943,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01362853916385657,"score_gpt":0.2754974677098639,"score_spread":0.2618689285460074,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}