{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GESEG33SD2VIZ6PUQBH2Z6ESVE","short_pith_number":"pith:GESEG33S","canonical_record":{"source":{"id":"1707.04282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-13T18:54:49Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"5da6e129635fdfdcadf785a0e113f2c44ed08c58c7fe0cc0367103ff2e85795f","abstract_canon_sha256":"6acfd50f4d8c60320b77ee1ad493e95f011326758c8efbb3e38342405a825a48"},"schema_version":"1.0"},"canonical_sha256":"3124436f721eaa8cf9f4804facf892a91e38006a921b9616b8e61461dd7550e0","source":{"kind":"arxiv","id":"1707.04282","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04282","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04282v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04282","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"GESEG33SD2VI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GESEG33SD2VIZ6PU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GESEG33S","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GESEG33SD2VIZ6PUQBH2Z6ESVE","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-13T18:54:49Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"5da6e129635fdfdcadf785a0e113f2c44ed08c58c7fe0cc0367103ff2e85795f","abstract_canon_sha256":"6acfd50f4d8c60320b77ee1ad493e95f011326758c8efbb3e38342405a825a48"},"schema_version":"1.0"},"canonical_sha256":"3124436f721eaa8cf9f4804facf892a91e38006a921b9616b8e61461dd7550e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.789923Z","signature_b64":"RqtNwLrZcBlRynSHxageV2MZKUBD31Vmo9jf6uhmzCELiHnn1ABSFcLH7K6Tqb18JeM7kVsEpz/s3b3Zn7b1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3124436f721eaa8cf9f4804facf892a91e38006a921b9616b8e61461dd7550e0","last_reissued_at":"2026-05-18T00:40:18.788918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.788918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04282","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-18T00:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZbON1XuXNQGlLHQnWVBfPFD6vjWPFSeJwQTl8n163lMor2cvjPiocd36zutKZWkmzoi9t+Ft/1QfWt6Ox+OBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:24:06.884604Z"},"content_sha256":"35d3aca731f2744ccd2800d4f0d2e14db5b4674d75c20a314de89160e0ffb614","schema_version":"1.0","event_id":"sha256:35d3aca731f2744ccd2800d4f0d2e14db5b4674d75c20a314de89160e0ffb614"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GESEG33SD2VIZ6PUQBH2Z6ESVE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Miguel A. Mosteiro","submitted_at":"2017-07-13T18:54:49Z","abstract_excerpt":"Starting with Michail, Chatzigiannakis, and Spirakis work, the problem of Counting the number of nodes in Anonymous Dynamic Networks has attracted a lot of attention. The problem is challenging because nodes are indistinguishable (they lack identifiers and execute the same program) and the topology may change arbitrarily from round to round of communication, as long as the network is connected in each round. The problem is central in distributed computing as the number of participants is frequently needed to make important decisions, such as termination, agreement, synchronization, and many ot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04282","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-18T00:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yq+P1E7NH7/m259ApLDESiE/0R2EKcXHlT4J9LQSpNNqX5UvOA2gLPsyZxGdRDT2/sp2RhiNFdz7ZldiBWesDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:24:06.884954Z"},"content_sha256":"0b2b114e493f953f8ed2306883cc1f2dd66897d937dfb48b236b66545e32d6b3","schema_version":"1.0","event_id":"sha256:0b2b114e493f953f8ed2306883cc1f2dd66897d937dfb48b236b66545e32d6b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GESEG33SD2VIZ6PUQBH2Z6ESVE/bundle.json","state_url":"https://pith.science/pith/GESEG33SD2VIZ6PUQBH2Z6ESVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GESEG33SD2VIZ6PUQBH2Z6ESVE/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-06-23T12:24:06Z","links":{"resolver":"https://pith.science/pith/GESEG33SD2VIZ6PUQBH2Z6ESVE","bundle":"https://pith.science/pith/GESEG33SD2VIZ6PUQBH2Z6ESVE/bundle.json","state":"https://pith.science/pith/GESEG33SD2VIZ6PUQBH2Z6ESVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GESEG33SD2VIZ6PUQBH2Z6ESVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GESEG33SD2VIZ6PUQBH2Z6ESVE","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":"6acfd50f4d8c60320b77ee1ad493e95f011326758c8efbb3e38342405a825a48","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-13T18:54:49Z","title_canon_sha256":"5da6e129635fdfdcadf785a0e113f2c44ed08c58c7fe0cc0367103ff2e85795f"},"schema_version":"1.0","source":{"id":"1707.04282","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04282","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04282v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04282","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"GESEG33SD2VI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GESEG33SD2VIZ6PU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GESEG33S","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:0b2b114e493f953f8ed2306883cc1f2dd66897d937dfb48b236b66545e32d6b3","target":"graph","created_at":"2026-05-18T00:40:18Z","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":"Starting with Michail, Chatzigiannakis, and Spirakis work, the problem of Counting the number of nodes in Anonymous Dynamic Networks has attracted a lot of attention. The problem is challenging because nodes are indistinguishable (they lack identifiers and execute the same program) and the topology may change arbitrarily from round to round of communication, as long as the network is connected in each round. The problem is central in distributed computing as the number of participants is frequently needed to make important decisions, such as termination, agreement, synchronization, and many ot","authors_text":"Dariusz R. Kowalski, Miguel A. Mosteiro","cross_cats":["cs.DS","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-13T18:54:49Z","title":"Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04282","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:35d3aca731f2744ccd2800d4f0d2e14db5b4674d75c20a314de89160e0ffb614","target":"record","created_at":"2026-05-18T00:40:18Z","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":"6acfd50f4d8c60320b77ee1ad493e95f011326758c8efbb3e38342405a825a48","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-13T18:54:49Z","title_canon_sha256":"5da6e129635fdfdcadf785a0e113f2c44ed08c58c7fe0cc0367103ff2e85795f"},"schema_version":"1.0","source":{"id":"1707.04282","kind":"arxiv","version":1}},"canonical_sha256":"3124436f721eaa8cf9f4804facf892a91e38006a921b9616b8e61461dd7550e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3124436f721eaa8cf9f4804facf892a91e38006a921b9616b8e61461dd7550e0","first_computed_at":"2026-05-18T00:40:18.788918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:18.788918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RqtNwLrZcBlRynSHxageV2MZKUBD31Vmo9jf6uhmzCELiHnn1ABSFcLH7K6Tqb18JeM7kVsEpz/s3b3Zn7b1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:18.789923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04282","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35d3aca731f2744ccd2800d4f0d2e14db5b4674d75c20a314de89160e0ffb614","sha256:0b2b114e493f953f8ed2306883cc1f2dd66897d937dfb48b236b66545e32d6b3"],"state_sha256":"6c903082c47101d2cc6dadc9f0f47654f7500c2fbcfe5cc6b567a6ebfa0fbae8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWEuuLREkL/Dut6o3Xwvk0UgOKhccAJN+bJAsZGPdJUHKjBk1fjO5zNbuPNdc3GlRXX4zE8YMGrtX3zzpWrvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:24:06.886973Z","bundle_sha256":"854029296e33a2f7b02e9a0d5bb3fbd72c218fa50b2d4a7054165bf6b1f41b77"}}