{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZSDJ3XMFQGJAISYKQVOZGERGFO","short_pith_number":"pith:ZSDJ3XMF","schema_version":"1.0","canonical_sha256":"cc869ddd858192044b0a855d9312262b91a387edc0cc0a819f28ca58ad3e8d5d","source":{"kind":"arxiv","id":"1601.04306","version":1},"attestation_state":"computed","paper":{"title":"Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Scott, Lei Xu, Peter Jeavons","submitted_at":"2016-01-17T16:19:50Z","abstract_excerpt":"We propose distributed algorithms for two well-established problems that operate efficiently under extremely harsh conditions. Our algorithms achieve state-of-the-art performance in a simple and novel way.\n  Our algorithm for maximal independent set selection operates on a network of identical anonymous processors. The processor at each node has no prior information about the network. At each time step, each node can only broadcast a single bit to all its neighbours, or remain silent. Each node can detect whether one or more neighbours have broadcast, but cannot tell how many of its neighbours"},"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":"1601.04306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-17T16:19:50Z","cross_cats_sorted":[],"title_canon_sha256":"827a489801768d21aefc3981c84d5da9db8fed78da3fa72828c24334c554549c","abstract_canon_sha256":"a621ea78cdcf8090be68f22a2785d3c08ad19399bdd474d7dc574cd22e9f0e49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:45.377488Z","signature_b64":"gDqzyl+h5jMduwKVIfSbuxzshbg/d+R/gYchQQquU6RKzvBIrf6RuDM/d5IddwTFxoojmnrPo/NbR1UYJKrXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc869ddd858192044b0a855d9312262b91a387edc0cc0a819f28ca58ad3e8d5d","last_reissued_at":"2026-05-18T01:22:45.376911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:45.376911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Scott, Lei Xu, Peter Jeavons","submitted_at":"2016-01-17T16:19:50Z","abstract_excerpt":"We propose distributed algorithms for two well-established problems that operate efficiently under extremely harsh conditions. Our algorithms achieve state-of-the-art performance in a simple and novel way.\n  Our algorithm for maximal independent set selection operates on a network of identical anonymous processors. The processor at each node has no prior information about the network. At each time step, each node can only broadcast a single bit to all its neighbours, or remain silent. Each node can detect whether one or more neighbours have broadcast, but cannot tell how many of its neighbours"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04306","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.04306","created_at":"2026-05-18T01:22:45.376993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04306v1","created_at":"2026-05-18T01:22:45.376993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04306","created_at":"2026-05-18T01:22:45.376993+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSDJ3XMFQGJA","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSDJ3XMFQGJAISYK","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSDJ3XMF","created_at":"2026-05-18T12:30:55.937587+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/ZSDJ3XMFQGJAISYKQVOZGERGFO","json":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO.json","graph_json":"https://pith.science/api/pith-number/ZSDJ3XMFQGJAISYKQVOZGERGFO/graph.json","events_json":"https://pith.science/api/pith-number/ZSDJ3XMFQGJAISYKQVOZGERGFO/events.json","paper":"https://pith.science/paper/ZSDJ3XMF"},"agent_actions":{"view_html":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO","download_json":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO.json","view_paper":"https://pith.science/paper/ZSDJ3XMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04306&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSDJ3XMFQGJAISYKQVOZGERGFO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSDJ3XMFQGJAISYKQVOZGERGFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/action/storage_attestation","attest_author":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/action/author_attestation","sign_citation":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/action/citation_signature","submit_replication":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/action/replication_record"}},"created_at":"2026-05-18T01:22:45.376993+00:00","updated_at":"2026-05-18T01:22:45.376993+00:00"}