{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JNR4SZXJKANRXISCXPHJRRTEYR","short_pith_number":"pith:JNR4SZXJ","schema_version":"1.0","canonical_sha256":"4b63c966e9501b1ba242bbce98c664c465416ad08d832d0c4cc04ddee2e95898","source":{"kind":"arxiv","id":"1012.0009","version":3},"attestation_state":"computed","paper":{"title":"Time-Varying Graphs and Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SI","physics.soc-ph"],"primary_cat":"cs.DC","authors_text":"Arnaud Casteigts, Nicola Santoro, Paola Flocchini, Walter Quattrociocchi","submitted_at":"2010-11-30T21:03:42Z","abstract_excerpt":"The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems -- delay-tolerant networks, opportunistic-mobility networks, social networks -- obtaining closely related insights. Indeed, the concepts discovered in these investigations can be viewed as parts of the same conceptual universe; and the formal models proposed so far to express some specific concepts are components of a larger formal description of this universe. The main contribution of this paper is to integrate the vast collection of concepts, formalisms, and results found"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1012.0009","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-11-30T21:03:42Z","cross_cats_sorted":["cs.NI","cs.SI","physics.soc-ph"],"title_canon_sha256":"62904ff9491cbca8163b04eab57cb12a2b755a50923dc5ffd109b94ab7f5b348","abstract_canon_sha256":"d86d13f07f2b3cedb165211f752d1d506e682050cc97841a6ebcb17df52921d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:12.032064Z","signature_b64":"d6YoYsUAkTuy1puPZ8H4zF+u4wzPibkr3y1cqGkm1nXTn5QPEzuiY9v4MmAwa00diyiDWFaR8h9rPEL2dNmLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b63c966e9501b1ba242bbce98c664c465416ad08d832d0c4cc04ddee2e95898","last_reissued_at":"2026-05-18T04:02:12.031499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:12.031499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Varying Graphs and Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SI","physics.soc-ph"],"primary_cat":"cs.DC","authors_text":"Arnaud Casteigts, Nicola Santoro, Paola Flocchini, Walter Quattrociocchi","submitted_at":"2010-11-30T21:03:42Z","abstract_excerpt":"The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems -- delay-tolerant networks, opportunistic-mobility networks, social networks -- obtaining closely related insights. Indeed, the concepts discovered in these investigations can be viewed as parts of the same conceptual universe; and the formal models proposed so far to express some specific concepts are components of a larger formal description of this universe. The main contribution of this paper is to integrate the vast collection of concepts, formalisms, and results found"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0009","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.0009","created_at":"2026-05-18T04:02:12.031597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.0009v3","created_at":"2026-05-18T04:02:12.031597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0009","created_at":"2026-05-18T04:02:12.031597+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNR4SZXJKANR","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNR4SZXJKANRXISC","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNR4SZXJ","created_at":"2026-05-18T12:26:09.077623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":200,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19399","citing_title":"Optimal Routing for Federated Learning over Dynamic Satellite Networks: Tractable or Not?","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JNR4SZXJKANRXISCXPHJRRTEYR","json":"https://pith.science/pith/JNR4SZXJKANRXISCXPHJRRTEYR.json","graph_json":"https://pith.science/api/pith-number/JNR4SZXJKANRXISCXPHJRRTEYR/graph.json","events_json":"https://pith.science/api/pith-number/JNR4SZXJKANRXISCXPHJRRTEYR/events.json","paper":"https://pith.science/paper/JNR4SZXJ"},"agent_actions":{"view_html":"https://pith.science/pith/JNR4SZXJKANRXISCXPHJRRTEYR","download_json":"https://pith.science/pith/JNR4SZXJKANRXISCXPHJRRTEYR.json","view_paper":"https://pith.science/paper/JNR4SZXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.0009&json=true","fetch_graph":"https://pith.science/api/pith-number/JNR4SZXJKANRXISCXPHJRRTEYR/graph.json","fetch_events":"https://pith.science/api/pith-number/JNR4SZXJKANRXISCXPHJRRTEYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNR4SZXJKANRXISCXPHJRRTEYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNR4SZXJKANRXISCXPHJRRTEYR/action/storage_attestation","attest_author":"https://pith.science/pith/JNR4SZXJKANRXISCXPHJRRTEYR/action/author_attestation","sign_citation":"https://pith.science/pith/JNR4SZXJKANRXISCXPHJRRTEYR/action/citation_signature","submit_replication":"https://pith.science/pith/JNR4SZXJKANRXISCXPHJRRTEYR/action/replication_record"}},"created_at":"2026-05-18T04:02:12.031597+00:00","updated_at":"2026-05-18T04:02:12.031597+00:00"}