{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XJ6GOPIHUNPGNKEBPJLHALL4UH","short_pith_number":"pith:XJ6GOPIH","canonical_record":{"source":{"id":"1509.02140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-07T18:46:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2df7069b6b312d2904cdab788aacfc074afe264e0fecf58fd92b81fb93e0514c","abstract_canon_sha256":"8696ebfde962f5e613d40ada15be68c5d62c385185953f8d7a495532b54b6570"},"schema_version":"1.0"},"canonical_sha256":"ba7c673d07a35e66a8817a56702d7ca1feec0ee6395478c7dea71f5a415b1b40","source":{"kind":"arxiv","id":"1509.02140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02140","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02140v1","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02140","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"XJ6GOPIHUNPG","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XJ6GOPIHUNPGNKEB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XJ6GOPIH","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XJ6GOPIHUNPGNKEBPJLHALL4UH","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-07T18:46:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2df7069b6b312d2904cdab788aacfc074afe264e0fecf58fd92b81fb93e0514c","abstract_canon_sha256":"8696ebfde962f5e613d40ada15be68c5d62c385185953f8d7a495532b54b6570"},"schema_version":"1.0"},"canonical_sha256":"ba7c673d07a35e66a8817a56702d7ca1feec0ee6395478c7dea71f5a415b1b40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:49.650488Z","signature_b64":"X2jmudjocR2yi8Kp1sLM9aMZoJtsPvB4bRVpKtOA0vIIbLrhgYC5AOShd24dX5wn/7cr/4rdHt1tbKvhfnVrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba7c673d07a35e66a8817a56702d7ca1feec0ee6395478c7dea71f5a415b1b40","last_reissued_at":"2026-05-18T01:33:49.649793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:49.649793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02140","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:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mPse9mhor3DBGZ+4sph4PIS21yC9B/ZBkBkI25RC02Xo9WS4v2Px7dCJtzSA7GssgveOnsq6eqzaEEA4zXpLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:22:34.023151Z"},"content_sha256":"5ac3c3fd9de4a090b13c6b18834772b6d1a02df3bc1f1a48f0ff4adede5e6ba4","schema_version":"1.0","event_id":"sha256:5ac3c3fd9de4a090b13c6b18834772b6d1a02df3bc1f1a48f0ff4adede5e6ba4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XJ6GOPIHUNPGNKEBPJLHALL4UH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster Counting Protocol for Anonymous Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alessia Milani, Miguel A. Mosteiro","submitted_at":"2015-09-07T18:46:18Z","abstract_excerpt":"We study the problem of counting the number of nodes in a slotted-time communication network, under the challenging assumption that nodes do not have identifiers and the network topology changes frequently. That is, for each time slot links among nodes can change arbitrarily provided that the network is always connected. Tolerating dynamic topologies is crucial in face of mobility and unreliable communication whereas, even if identifiers are available, it might be convenient to ignore them in massive networks with changing topology. Counting is a fundamental task in distributed computing since"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02140","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:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OROnQze9ur6PLpzxp9FXk6FEogQ+aWxq4SeZvir5RQIlHTDXjK029qc+oIB9VUgRav7EHRfgQdoMcmcmspPRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:22:34.023535Z"},"content_sha256":"aab26e257a11eb2c2520a145c28819b43f558d516b54e690816ddb9dcda5535a","schema_version":"1.0","event_id":"sha256:aab26e257a11eb2c2520a145c28819b43f558d516b54e690816ddb9dcda5535a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJ6GOPIHUNPGNKEBPJLHALL4UH/bundle.json","state_url":"https://pith.science/pith/XJ6GOPIHUNPGNKEBPJLHALL4UH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJ6GOPIHUNPGNKEBPJLHALL4UH/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-07-02T08:22:34Z","links":{"resolver":"https://pith.science/pith/XJ6GOPIHUNPGNKEBPJLHALL4UH","bundle":"https://pith.science/pith/XJ6GOPIHUNPGNKEBPJLHALL4UH/bundle.json","state":"https://pith.science/pith/XJ6GOPIHUNPGNKEBPJLHALL4UH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJ6GOPIHUNPGNKEBPJLHALL4UH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XJ6GOPIHUNPGNKEBPJLHALL4UH","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":"8696ebfde962f5e613d40ada15be68c5d62c385185953f8d7a495532b54b6570","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-07T18:46:18Z","title_canon_sha256":"2df7069b6b312d2904cdab788aacfc074afe264e0fecf58fd92b81fb93e0514c"},"schema_version":"1.0","source":{"id":"1509.02140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02140","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02140v1","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02140","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"XJ6GOPIHUNPG","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XJ6GOPIHUNPGNKEB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XJ6GOPIH","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:aab26e257a11eb2c2520a145c28819b43f558d516b54e690816ddb9dcda5535a","target":"graph","created_at":"2026-05-18T01:33:49Z","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":"We study the problem of counting the number of nodes in a slotted-time communication network, under the challenging assumption that nodes do not have identifiers and the network topology changes frequently. That is, for each time slot links among nodes can change arbitrarily provided that the network is always connected. Tolerating dynamic topologies is crucial in face of mobility and unreliable communication whereas, even if identifiers are available, it might be convenient to ignore them in massive networks with changing topology. Counting is a fundamental task in distributed computing since","authors_text":"Alessia Milani, Miguel A. Mosteiro","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-07T18:46:18Z","title":"A Faster Counting Protocol for Anonymous Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02140","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:5ac3c3fd9de4a090b13c6b18834772b6d1a02df3bc1f1a48f0ff4adede5e6ba4","target":"record","created_at":"2026-05-18T01:33:49Z","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":"8696ebfde962f5e613d40ada15be68c5d62c385185953f8d7a495532b54b6570","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-07T18:46:18Z","title_canon_sha256":"2df7069b6b312d2904cdab788aacfc074afe264e0fecf58fd92b81fb93e0514c"},"schema_version":"1.0","source":{"id":"1509.02140","kind":"arxiv","version":1}},"canonical_sha256":"ba7c673d07a35e66a8817a56702d7ca1feec0ee6395478c7dea71f5a415b1b40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba7c673d07a35e66a8817a56702d7ca1feec0ee6395478c7dea71f5a415b1b40","first_computed_at":"2026-05-18T01:33:49.649793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:49.649793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X2jmudjocR2yi8Kp1sLM9aMZoJtsPvB4bRVpKtOA0vIIbLrhgYC5AOShd24dX5wn/7cr/4rdHt1tbKvhfnVrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:49.650488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ac3c3fd9de4a090b13c6b18834772b6d1a02df3bc1f1a48f0ff4adede5e6ba4","sha256:aab26e257a11eb2c2520a145c28819b43f558d516b54e690816ddb9dcda5535a"],"state_sha256":"33d00b2be920f6349e53819d1d86a6e23f1c1be37a367fe900298ec03eb74daf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R7fkM7wXDY0Nf4YwD5UhQX73ZoUZCCJPhnUByE7BlDkY6sQdLnzaEfXZRpkRJ54Lwu3HB+Y7lmLzVBwf7nH3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T08:22:34.025511Z","bundle_sha256":"de078f9a4f76a2323fa6e47581ad16d6e4e4652fd64110cfbe88b8b7bf9e071d"}}