{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YDTQZEJNGLEAOUEEBSPBIHZBMM","short_pith_number":"pith:YDTQZEJN","canonical_record":{"source":{"id":"1603.05459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-17T12:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"103a580c1c0c1c7ed154fb543b6c65d29b8155675fca9006bbf25957c31306f6","abstract_canon_sha256":"648737c1c1ca2beed44c6fd2268f578de0622bac120638617bca5b08c88ec8e0"},"schema_version":"1.0"},"canonical_sha256":"c0e70c912d32c80750840c9e141f21631ae5f49af84acc02018507b7519d2f13","source":{"kind":"arxiv","id":"1603.05459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05459","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05459v1","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05459","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"YDTQZEJNGLEA","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YDTQZEJNGLEAOUEE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YDTQZEJN","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YDTQZEJNGLEAOUEEBSPBIHZBMM","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-17T12:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"103a580c1c0c1c7ed154fb543b6c65d29b8155675fca9006bbf25957c31306f6","abstract_canon_sha256":"648737c1c1ca2beed44c6fd2268f578de0622bac120638617bca5b08c88ec8e0"},"schema_version":"1.0"},"canonical_sha256":"c0e70c912d32c80750840c9e141f21631ae5f49af84acc02018507b7519d2f13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:56.278763Z","signature_b64":"9ks43/l9/PTUHZW3eBhryd6RpBCeTuhUU15lYwNb0ear92COGA/zx8Z/JH2QrDJ/KJzl2B2E6rn17S64eVNLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0e70c912d32c80750840c9e141f21631ae5f49af84acc02018507b7519d2f13","last_reissued_at":"2026-05-18T01:18:56.278415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:56.278415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05459","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KOkrv2a1eQksPjRRsAIUv/vxF1goNil5wkS4aaiIlYkVkPTayobED0p/TrgD/2UJ+1Fq9nW4NG1uh6b3b6SzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:52:44.528011Z"},"content_sha256":"115965f5e52df68ebab603e5f3ac2881a3f032742f4f2c5ad90bffdb011c26ce","schema_version":"1.0","event_id":"sha256:115965f5e52df68ebab603e5f3ac2881a3f032742f4f2c5ad90bffdb011c26ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YDTQZEJNGLEAOUEEBSPBIHZBMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting in Practical Anonymous Dynamic Networks is Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alessia Milani, Maitri Chakraborty, Miguel A. Mosteiro","submitted_at":"2016-03-17T12:51:50Z","abstract_excerpt":"Anonymous Dynamic Networks is a harsh computational environment due to changing topology and lack of identifiers. Computing the size of the network, a problem known as Counting, is particularly challenging because messages received cannot be tagged to a specific sender. Previous works on Counting in Anonymous Dynamic Networks do not provide enough guarantees to be used in practice. Indeed, they either compute only an upper bound on the network size that may be as bad as exponential, or guarantee only double-exponential running time, or do not terminate, or guarantee only eventual termination w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05459","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkln0kqUohdoxxFlTzpFd24C0rSyMWD0abAlSA5XlQoG3KPDWOme6etvWn0vd+/kn1tz0+9jD88QfjpTOZ0BBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:52:44.528668Z"},"content_sha256":"ee8a75e5f8d8e51d3442ebc74a9999c34e455e035893e467223965f0e6458cc0","schema_version":"1.0","event_id":"sha256:ee8a75e5f8d8e51d3442ebc74a9999c34e455e035893e467223965f0e6458cc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDTQZEJNGLEAOUEEBSPBIHZBMM/bundle.json","state_url":"https://pith.science/pith/YDTQZEJNGLEAOUEEBSPBIHZBMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDTQZEJNGLEAOUEEBSPBIHZBMM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T08:52:44Z","links":{"resolver":"https://pith.science/pith/YDTQZEJNGLEAOUEEBSPBIHZBMM","bundle":"https://pith.science/pith/YDTQZEJNGLEAOUEEBSPBIHZBMM/bundle.json","state":"https://pith.science/pith/YDTQZEJNGLEAOUEEBSPBIHZBMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDTQZEJNGLEAOUEEBSPBIHZBMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YDTQZEJNGLEAOUEEBSPBIHZBMM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"648737c1c1ca2beed44c6fd2268f578de0622bac120638617bca5b08c88ec8e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-17T12:51:50Z","title_canon_sha256":"103a580c1c0c1c7ed154fb543b6c65d29b8155675fca9006bbf25957c31306f6"},"schema_version":"1.0","source":{"id":"1603.05459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05459","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05459v1","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05459","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"YDTQZEJNGLEA","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YDTQZEJNGLEAOUEE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YDTQZEJN","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:ee8a75e5f8d8e51d3442ebc74a9999c34e455e035893e467223965f0e6458cc0","target":"graph","created_at":"2026-05-18T01:18:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Anonymous Dynamic Networks is a harsh computational environment due to changing topology and lack of identifiers. Computing the size of the network, a problem known as Counting, is particularly challenging because messages received cannot be tagged to a specific sender. Previous works on Counting in Anonymous Dynamic Networks do not provide enough guarantees to be used in practice. Indeed, they either compute only an upper bound on the network size that may be as bad as exponential, or guarantee only double-exponential running time, or do not terminate, or guarantee only eventual termination w","authors_text":"Alessia Milani, Maitri Chakraborty, Miguel A. Mosteiro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-17T12:51:50Z","title":"Counting in Practical Anonymous Dynamic Networks is Polynomial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05459","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:115965f5e52df68ebab603e5f3ac2881a3f032742f4f2c5ad90bffdb011c26ce","target":"record","created_at":"2026-05-18T01:18:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"648737c1c1ca2beed44c6fd2268f578de0622bac120638617bca5b08c88ec8e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-17T12:51:50Z","title_canon_sha256":"103a580c1c0c1c7ed154fb543b6c65d29b8155675fca9006bbf25957c31306f6"},"schema_version":"1.0","source":{"id":"1603.05459","kind":"arxiv","version":1}},"canonical_sha256":"c0e70c912d32c80750840c9e141f21631ae5f49af84acc02018507b7519d2f13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0e70c912d32c80750840c9e141f21631ae5f49af84acc02018507b7519d2f13","first_computed_at":"2026-05-18T01:18:56.278415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:56.278415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ks43/l9/PTUHZW3eBhryd6RpBCeTuhUU15lYwNb0ear92COGA/zx8Z/JH2QrDJ/KJzl2B2E6rn17S64eVNLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:56.278763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:115965f5e52df68ebab603e5f3ac2881a3f032742f4f2c5ad90bffdb011c26ce","sha256:ee8a75e5f8d8e51d3442ebc74a9999c34e455e035893e467223965f0e6458cc0"],"state_sha256":"b121c6aae84263510cc87e56d4a54717e08ac204b15c49512fe8b0cab4b5899b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lh9iInfn0nJXsscyUun9FKRdDbDZVzdIJBMu4iW2w6ZCZCUjqPIyNh5+NSATo8ORJNvXftrmUTWSrEzB3x3ZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:52:44.532069Z","bundle_sha256":"759cabf4ce3b545b4711e7718920ea08cc5e49cbf2da905149f2acdb24a783d2"}}