{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VBQRPN7PZLYMS4UBLXSQIUBX7X","short_pith_number":"pith:VBQRPN7P","schema_version":"1.0","canonical_sha256":"a86117b7efcaf0c972815de5045037fdd679adbf94d80d80ec73bd631d0137a9","source":{"kind":"arxiv","id":"2411.09957","version":2},"attestation_state":"computed","paper":{"title":"Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Takumi Araya, Yuichi Sudo","submitted_at":"2024-11-15T05:25:38Z","abstract_excerpt":"This paper addresses the collision detection problem in population protocols. The network consists of state machines called agents. At each time step, exactly one pair of agents is chosen uniformly at random to have an interaction, changing the states of the two agents. The collision detection problem involves each agent starting with an input integer between $1$ and $n$, where $n$ is the number of agents, and requires those agents to determine whether there are any duplicate input values among all agents. Specifically, the goal is for all agents to output false if all input values are distinc"},"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":"2411.09957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-11-15T05:25:38Z","cross_cats_sorted":[],"title_canon_sha256":"5a04d880322f1216fb1a46cb19597dd5c4189d7d1876b2517ea54e98377a847f","abstract_canon_sha256":"571714622d42299ba027c8f4465e76db5a72eacc769dea7a316bb0ab5333bc90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:50.559357Z","signature_b64":"idLgdhd2gnZFYB9JDnTjK8q8VOhuNJACQU039M+ijxfYT0bmiMDRTU3IitWpDtxRj46VmOsqa3gowGSZb6f+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a86117b7efcaf0c972815de5045037fdd679adbf94d80d80ec73bd631d0137a9","last_reissued_at":"2026-07-05T10:31:50.558846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:50.558846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Takumi Araya, Yuichi Sudo","submitted_at":"2024-11-15T05:25:38Z","abstract_excerpt":"This paper addresses the collision detection problem in population protocols. The network consists of state machines called agents. At each time step, exactly one pair of agents is chosen uniformly at random to have an interaction, changing the states of the two agents. The collision detection problem involves each agent starting with an input integer between $1$ and $n$, where $n$ is the number of agents, and requires those agents to determine whether there are any duplicate input values among all agents. Specifically, the goal is for all agents to output false if all input values are distinc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09957","kind":"arxiv","version":2},"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/2411.09957/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":"2411.09957","created_at":"2026-07-05T10:31:50.558906+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.09957v2","created_at":"2026-07-05T10:31:50.558906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09957","created_at":"2026-07-05T10:31:50.558906+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBQRPN7PZLYM","created_at":"2026-07-05T10:31:50.558906+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBQRPN7PZLYMS4UB","created_at":"2026-07-05T10:31:50.558906+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBQRPN7P","created_at":"2026-07-05T10:31:50.558906+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23649","citing_title":"Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBQRPN7PZLYMS4UBLXSQIUBX7X","json":"https://pith.science/pith/VBQRPN7PZLYMS4UBLXSQIUBX7X.json","graph_json":"https://pith.science/api/pith-number/VBQRPN7PZLYMS4UBLXSQIUBX7X/graph.json","events_json":"https://pith.science/api/pith-number/VBQRPN7PZLYMS4UBLXSQIUBX7X/events.json","paper":"https://pith.science/paper/VBQRPN7P"},"agent_actions":{"view_html":"https://pith.science/pith/VBQRPN7PZLYMS4UBLXSQIUBX7X","download_json":"https://pith.science/pith/VBQRPN7PZLYMS4UBLXSQIUBX7X.json","view_paper":"https://pith.science/paper/VBQRPN7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.09957&json=true","fetch_graph":"https://pith.science/api/pith-number/VBQRPN7PZLYMS4UBLXSQIUBX7X/graph.json","fetch_events":"https://pith.science/api/pith-number/VBQRPN7PZLYMS4UBLXSQIUBX7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBQRPN7PZLYMS4UBLXSQIUBX7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBQRPN7PZLYMS4UBLXSQIUBX7X/action/storage_attestation","attest_author":"https://pith.science/pith/VBQRPN7PZLYMS4UBLXSQIUBX7X/action/author_attestation","sign_citation":"https://pith.science/pith/VBQRPN7PZLYMS4UBLXSQIUBX7X/action/citation_signature","submit_replication":"https://pith.science/pith/VBQRPN7PZLYMS4UBLXSQIUBX7X/action/replication_record"}},"created_at":"2026-07-05T10:31:50.558906+00:00","updated_at":"2026-07-05T10:31:50.558906+00:00"}