{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DQLCLMGIA6C5F54KHDMK7OQTNB","short_pith_number":"pith:DQLCLMGI","schema_version":"1.0","canonical_sha256":"1c1625b0c80785d2f78a38d8afba1368479db3d0d0fb0afbb7cb2a93ec0e1a6a","source":{"kind":"arxiv","id":"2607.08358","version":1},"attestation_state":"computed","paper":{"title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Giovanni Viglietta, Giuseppe Antonio Di Luna, Thibaut Blanc","submitted_at":"2026-07-09T11:13:17Z","abstract_excerpt":"We initiate the study of deterministic computation in anonymous dynamic networks where each agent broadcasts one bit per round and receives only the number of neighbors broadcasting each bit value. Despite this severe restriction, surprisingly rich global computation is possible.\n  With a unique leader and a known upper bound $U$ on the network size $n$, we give a terminating algorithm for any computable function of the input multiset in $O(n^3\\log^2 n+U)$ rounds, for inputs from a universe of size $N=2^{O(n\\log n)}$. Without prior knowledge of $n$, we design a stabilizing algorithm for the sa"},"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":"2607.08358","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-09T11:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"65a5fa582ec1b366bdb4335f72d03d9d07d9b5fb408b81447e3437eda05c4e5c","abstract_canon_sha256":"41d8e81d2254530b78b047d93a14dc516ab330e3b4007db1b0e406f0f582fa61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:48.047234Z","signature_b64":"BhNcsuZXweYVcintfxzsgkgtASBBQ6eYxfnT1AIdPcjj3Ii+EqVlAyEtZAcJPur1mDmhzf7d739zGtXWELHJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1625b0c80785d2f78a38d8afba1368479db3d0d0fb0afbb7cb2a93ec0e1a6a","last_reissued_at":"2026-07-10T01:19:48.046824Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:48.046824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing in Anonymous Dynamic Networks with One-Bit Communications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Giovanni Viglietta, Giuseppe Antonio Di Luna, Thibaut Blanc","submitted_at":"2026-07-09T11:13:17Z","abstract_excerpt":"We initiate the study of deterministic computation in anonymous dynamic networks where each agent broadcasts one bit per round and receives only the number of neighbors broadcasting each bit value. Despite this severe restriction, surprisingly rich global computation is possible.\n  With a unique leader and a known upper bound $U$ on the network size $n$, we give a terminating algorithm for any computable function of the input multiset in $O(n^3\\log^2 n+U)$ rounds, for inputs from a universe of size $N=2^{O(n\\log n)}$. Without prior knowledge of $n$, we design a stabilizing algorithm for the sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08358","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.08358/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.08358","created_at":"2026-07-10T01:19:48.046881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08358v1","created_at":"2026-07-10T01:19:48.046881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08358","created_at":"2026-07-10T01:19:48.046881+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQLCLMGIA6C5","created_at":"2026-07-10T01:19:48.046881+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQLCLMGIA6C5F54K","created_at":"2026-07-10T01:19:48.046881+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQLCLMGI","created_at":"2026-07-10T01:19:48.046881+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/DQLCLMGIA6C5F54KHDMK7OQTNB","json":"https://pith.science/pith/DQLCLMGIA6C5F54KHDMK7OQTNB.json","graph_json":"https://pith.science/api/pith-number/DQLCLMGIA6C5F54KHDMK7OQTNB/graph.json","events_json":"https://pith.science/api/pith-number/DQLCLMGIA6C5F54KHDMK7OQTNB/events.json","paper":"https://pith.science/paper/DQLCLMGI"},"agent_actions":{"view_html":"https://pith.science/pith/DQLCLMGIA6C5F54KHDMK7OQTNB","download_json":"https://pith.science/pith/DQLCLMGIA6C5F54KHDMK7OQTNB.json","view_paper":"https://pith.science/paper/DQLCLMGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08358&json=true","fetch_graph":"https://pith.science/api/pith-number/DQLCLMGIA6C5F54KHDMK7OQTNB/graph.json","fetch_events":"https://pith.science/api/pith-number/DQLCLMGIA6C5F54KHDMK7OQTNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQLCLMGIA6C5F54KHDMK7OQTNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQLCLMGIA6C5F54KHDMK7OQTNB/action/storage_attestation","attest_author":"https://pith.science/pith/DQLCLMGIA6C5F54KHDMK7OQTNB/action/author_attestation","sign_citation":"https://pith.science/pith/DQLCLMGIA6C5F54KHDMK7OQTNB/action/citation_signature","submit_replication":"https://pith.science/pith/DQLCLMGIA6C5F54KHDMK7OQTNB/action/replication_record"}},"created_at":"2026-07-10T01:19:48.046881+00:00","updated_at":"2026-07-10T01:19:48.046881+00:00"}