{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RFIJECD3DKX4UNOKEYGUWQXFGF","short_pith_number":"pith:RFIJECD3","schema_version":"1.0","canonical_sha256":"895092087b1aafca35ca260d4b42e531409334ec4b106b3dd80b92eaf92c44c5","source":{"kind":"arxiv","id":"1102.5529","version":5},"attestation_state":"computed","paper":{"title":"Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Afonso Ferreira, Arnaud Casteigts, Serge Chaumette","submitted_at":"2011-02-27T17:59:14Z","abstract_excerpt":"Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at the assumptions they make on the underlying network. We investigate this question from the perspective of network dynamics. In particular, we ask how a given property on the evolution of the network can be rigorously proven as necessary or sufficient for a given algorithm. The main contribution of this paper is to propose the combination of two existing tools in this direction: local computations by means of graph relabelings, and evolving graphs. Such a combination mak"},"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":"1102.5529","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-02-27T17:59:14Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"cc186bae1cf740bcbe9e680813417713d452ea1491e33c9d27fdb51d66daf5c7","abstract_canon_sha256":"bd9f701a457856fa341378dfbe189759a2a3536008875523aff3279b425f945f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:49.775107Z","signature_b64":"G9oONkUi2cHPoS1OleUpmtFpJDpmIfYPHmi9R5edWSBdikiSYmzhhrZ8fBulYQVv7uJsUbHZcLPzO2my369LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"895092087b1aafca35ca260d4b42e531409334ec4b106b3dd80b92eaf92c44c5","last_reissued_at":"2026-05-18T02:52:49.774670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:49.774670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Afonso Ferreira, Arnaud Casteigts, Serge Chaumette","submitted_at":"2011-02-27T17:59:14Z","abstract_excerpt":"Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at the assumptions they make on the underlying network. We investigate this question from the perspective of network dynamics. In particular, we ask how a given property on the evolution of the network can be rigorously proven as necessary or sufficient for a given algorithm. The main contribution of this paper is to propose the combination of two existing tools in this direction: local computations by means of graph relabelings, and evolving graphs. Such a combination mak"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5529","kind":"arxiv","version":5},"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":"1102.5529","created_at":"2026-05-18T02:52:49.774733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5529v5","created_at":"2026-05-18T02:52:49.774733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5529","created_at":"2026-05-18T02:52:49.774733+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFIJECD3DKX4","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFIJECD3DKX4UNOK","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFIJECD3","created_at":"2026-05-18T12:26:41.206345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RFIJECD3DKX4UNOKEYGUWQXFGF","json":"https://pith.science/pith/RFIJECD3DKX4UNOKEYGUWQXFGF.json","graph_json":"https://pith.science/api/pith-number/RFIJECD3DKX4UNOKEYGUWQXFGF/graph.json","events_json":"https://pith.science/api/pith-number/RFIJECD3DKX4UNOKEYGUWQXFGF/events.json","paper":"https://pith.science/paper/RFIJECD3"},"agent_actions":{"view_html":"https://pith.science/pith/RFIJECD3DKX4UNOKEYGUWQXFGF","download_json":"https://pith.science/pith/RFIJECD3DKX4UNOKEYGUWQXFGF.json","view_paper":"https://pith.science/paper/RFIJECD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5529&json=true","fetch_graph":"https://pith.science/api/pith-number/RFIJECD3DKX4UNOKEYGUWQXFGF/graph.json","fetch_events":"https://pith.science/api/pith-number/RFIJECD3DKX4UNOKEYGUWQXFGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFIJECD3DKX4UNOKEYGUWQXFGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFIJECD3DKX4UNOKEYGUWQXFGF/action/storage_attestation","attest_author":"https://pith.science/pith/RFIJECD3DKX4UNOKEYGUWQXFGF/action/author_attestation","sign_citation":"https://pith.science/pith/RFIJECD3DKX4UNOKEYGUWQXFGF/action/citation_signature","submit_replication":"https://pith.science/pith/RFIJECD3DKX4UNOKEYGUWQXFGF/action/replication_record"}},"created_at":"2026-05-18T02:52:49.774733+00:00","updated_at":"2026-05-18T02:52:49.774733+00:00"}