{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZSDJ3XMFQGJAISYKQVOZGERGFO","short_pith_number":"pith:ZSDJ3XMF","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"},"canonical_sha256":"cc869ddd858192044b0a855d9312262b91a387edc0cc0a819f28ca58ad3e8d5d","source":{"kind":"arxiv","id":"1601.04306","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04306","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04306v1","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04306","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZSDJ3XMFQGJA","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZSDJ3XMFQGJAISYK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZSDJ3XMF","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZSDJ3XMFQGJAISYKQVOZGERGFO","target":"record","payload":{"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"},"canonical_sha256":"cc869ddd858192044b0a855d9312262b91a387edc0cc0a819f28ca58ad3e8d5d","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"},"source_kind":"arxiv","source_id":"1601.04306","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:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xm6/PNrbQO+D6ERUujkUpUREKvNcd/UE/sEkADafBfCPy0AsT9P9ppGElKi8D7u8pp450GTXuExG/yO6c2B3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T10:57:59.928542Z"},"content_sha256":"d3448bd475e10188940efc5806a1d008bc385699b9fbf91f7dbd3828d1be8ef8","schema_version":"1.0","event_id":"sha256:d3448bd475e10188940efc5806a1d008bc385699b9fbf91f7dbd3828d1be8ef8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZSDJ3XMFQGJAISYKQVOZGERGFO","target":"graph","payload":{"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"},"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:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qe/Qn4w9fJWJyEqdFO56j7VQAfnWe+Xeu7iXs378OERszHTWwpStAHFSum+2hyLXpIJbwmCohgHPEGytaxdpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T10:57:59.928887Z"},"content_sha256":"46cb48547983cabc547ba18a31f05824329fb807062d661b0325bba6a49a4ff2","schema_version":"1.0","event_id":"sha256:46cb48547983cabc547ba18a31f05824329fb807062d661b0325bba6a49a4ff2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/bundle.json","state_url":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/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-02T10:57:59Z","links":{"resolver":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO","bundle":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/bundle.json","state":"https://pith.science/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSDJ3XMFQGJAISYKQVOZGERGFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZSDJ3XMFQGJAISYKQVOZGERGFO","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":"a621ea78cdcf8090be68f22a2785d3c08ad19399bdd474d7dc574cd22e9f0e49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-17T16:19:50Z","title_canon_sha256":"827a489801768d21aefc3981c84d5da9db8fed78da3fa72828c24334c554549c"},"schema_version":"1.0","source":{"id":"1601.04306","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04306","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04306v1","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04306","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZSDJ3XMFQGJA","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZSDJ3XMFQGJAISYK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZSDJ3XMF","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:46cb48547983cabc547ba18a31f05824329fb807062d661b0325bba6a49a4ff2","target":"graph","created_at":"2026-05-18T01:22:45Z","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 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","authors_text":"Alex Scott, Lei Xu, Peter Jeavons","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-17T16:19:50Z","title":"Feedback from Nature: Simple Randomised Distributed Algorithms for Maximal Independent Set Selection and Greedy Colouring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04306","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:d3448bd475e10188940efc5806a1d008bc385699b9fbf91f7dbd3828d1be8ef8","target":"record","created_at":"2026-05-18T01:22:45Z","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":"a621ea78cdcf8090be68f22a2785d3c08ad19399bdd474d7dc574cd22e9f0e49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-17T16:19:50Z","title_canon_sha256":"827a489801768d21aefc3981c84d5da9db8fed78da3fa72828c24334c554549c"},"schema_version":"1.0","source":{"id":"1601.04306","kind":"arxiv","version":1}},"canonical_sha256":"cc869ddd858192044b0a855d9312262b91a387edc0cc0a819f28ca58ad3e8d5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc869ddd858192044b0a855d9312262b91a387edc0cc0a819f28ca58ad3e8d5d","first_computed_at":"2026-05-18T01:22:45.376911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:45.376911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gDqzyl+h5jMduwKVIfSbuxzshbg/d+R/gYchQQquU6RKzvBIrf6RuDM/d5IddwTFxoojmnrPo/NbR1UYJKrXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:45.377488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04306","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3448bd475e10188940efc5806a1d008bc385699b9fbf91f7dbd3828d1be8ef8","sha256:46cb48547983cabc547ba18a31f05824329fb807062d661b0325bba6a49a4ff2"],"state_sha256":"2ba031c64e1bd600daf8d7617893b00e4d09d9d3ef221846f675259b6ca6c38b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCq/mSyHpB0bYgOz4HveXIziUk7sS6GqRZVHa4SEzNy1mxIV7U79EQzcszK8aJl5oy2RLQKM4mF9T6Bafwj7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T10:57:59.930810Z","bundle_sha256":"ac8a303849a0faba36161d26e5856b0f13bab70c0bc81ca741b31fd506f1a94f"}}