{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:ULBMKUVASOYTYUDN6YHJ6NR4ZW","short_pith_number":"pith:ULBMKUVA","canonical_record":{"source":{"id":"0909.0553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-03T00:36:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8a2156b86c7657daf40df09e4491b2ea5cc7c5fc658e3fd04b36ca511e47a663","abstract_canon_sha256":"82ea8f6ff1d17b8a6171f85f11aec56b9928ac98ef82eb708ebd5a5532ca45a6"},"schema_version":"1.0"},"canonical_sha256":"a2c2c552a093b13c506df60e9f363ccd9471273bc4580866b1ffeda45c028afb","source":{"kind":"arxiv","id":"0909.0553","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.0553","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"0909.0553v3","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0553","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"ULBMKUVASOYT","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"ULBMKUVASOYTYUDN","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"ULBMKUVA","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:ULBMKUVASOYTYUDN6YHJ6NR4ZW","target":"record","payload":{"canonical_record":{"source":{"id":"0909.0553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-03T00:36:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8a2156b86c7657daf40df09e4491b2ea5cc7c5fc658e3fd04b36ca511e47a663","abstract_canon_sha256":"82ea8f6ff1d17b8a6171f85f11aec56b9928ac98ef82eb708ebd5a5532ca45a6"},"schema_version":"1.0"},"canonical_sha256":"a2c2c552a093b13c506df60e9f363ccd9471273bc4580866b1ffeda45c028afb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:47.995843Z","signature_b64":"xlsMAe1vZoudDhbfksreLZLLrZ9bf/KsIy4cWOyXKQztBTWk/2v4/1eDa5yU0BOp+0aKfTMWSVyM3+KHVfSvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2c2c552a093b13c506df60e9f363ccd9471273bc4580866b1ffeda45c028afb","last_reissued_at":"2026-05-18T00:58:47.994948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:47.994948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.0553","source_version":3,"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:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5DnIom+5ATXESpzjCoVxIyaFxmZJima7s1Zqlb6stizqKN5fIE72kUwh6wirfMnaHHM/q1fbAHl3eDEb3o9JBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:40:58.633244Z"},"content_sha256":"10d8e83bf588179c97b81fd767b218d3fbc579666d32a93d6c0fde02c82e6a3b","schema_version":"1.0","event_id":"sha256:10d8e83bf588179c97b81fd767b218d3fbc579666d32a93d6c0fde02c82e6a3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:ULBMKUVASOYTYUDN6YHJ6NR4ZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Approach to Random Access: Reliable Communication and Reliable Collision Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anthony Ephremides, Jie Luo","submitted_at":"2009-09-03T00:36:58Z","abstract_excerpt":"This paper applies Information Theoretic analysis to packet-based random multiple access communication systems. A new channel coding approach is proposed for coding within each data packet with built-in support for bursty traffic properties, such as message underflow, and for random access properties, such as packet collision detection. The coding approach does not require joint communication rate determination either among the transmitters or between the transmitters and the receiver. Its performance limitation is characterized by an achievable region defined in terms of communication rates, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.0553","kind":"arxiv","version":3},"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:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7B2I0TaablTTMZfcb6hRP1a/kEQlt4JYYAlSW70nkK/wnvonkAawu6lVywhWFUVIjMm9KYQY4ExeJLWbfqtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:40:58.633602Z"},"content_sha256":"082e5a53e0830f8fab70eb28eb8d06c8a58f03f7fe4f0c586893f66dac813878","schema_version":"1.0","event_id":"sha256:082e5a53e0830f8fab70eb28eb8d06c8a58f03f7fe4f0c586893f66dac813878"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULBMKUVASOYTYUDN6YHJ6NR4ZW/bundle.json","state_url":"https://pith.science/pith/ULBMKUVASOYTYUDN6YHJ6NR4ZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULBMKUVASOYTYUDN6YHJ6NR4ZW/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-04T19:40:58Z","links":{"resolver":"https://pith.science/pith/ULBMKUVASOYTYUDN6YHJ6NR4ZW","bundle":"https://pith.science/pith/ULBMKUVASOYTYUDN6YHJ6NR4ZW/bundle.json","state":"https://pith.science/pith/ULBMKUVASOYTYUDN6YHJ6NR4ZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULBMKUVASOYTYUDN6YHJ6NR4ZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ULBMKUVASOYTYUDN6YHJ6NR4ZW","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":"82ea8f6ff1d17b8a6171f85f11aec56b9928ac98ef82eb708ebd5a5532ca45a6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-03T00:36:58Z","title_canon_sha256":"8a2156b86c7657daf40df09e4491b2ea5cc7c5fc658e3fd04b36ca511e47a663"},"schema_version":"1.0","source":{"id":"0909.0553","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.0553","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"0909.0553v3","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0553","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"ULBMKUVASOYT","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"ULBMKUVASOYTYUDN","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"ULBMKUVA","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:082e5a53e0830f8fab70eb28eb8d06c8a58f03f7fe4f0c586893f66dac813878","target":"graph","created_at":"2026-05-18T00:58:47Z","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":"This paper applies Information Theoretic analysis to packet-based random multiple access communication systems. A new channel coding approach is proposed for coding within each data packet with built-in support for bursty traffic properties, such as message underflow, and for random access properties, such as packet collision detection. The coding approach does not require joint communication rate determination either among the transmitters or between the transmitters and the receiver. Its performance limitation is characterized by an achievable region defined in terms of communication rates, ","authors_text":"Anthony Ephremides, Jie Luo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-03T00:36:58Z","title":"A New Approach to Random Access: Reliable Communication and Reliable Collision Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.0553","kind":"arxiv","version":3},"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:10d8e83bf588179c97b81fd767b218d3fbc579666d32a93d6c0fde02c82e6a3b","target":"record","created_at":"2026-05-18T00:58:47Z","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":"82ea8f6ff1d17b8a6171f85f11aec56b9928ac98ef82eb708ebd5a5532ca45a6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-03T00:36:58Z","title_canon_sha256":"8a2156b86c7657daf40df09e4491b2ea5cc7c5fc658e3fd04b36ca511e47a663"},"schema_version":"1.0","source":{"id":"0909.0553","kind":"arxiv","version":3}},"canonical_sha256":"a2c2c552a093b13c506df60e9f363ccd9471273bc4580866b1ffeda45c028afb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2c2c552a093b13c506df60e9f363ccd9471273bc4580866b1ffeda45c028afb","first_computed_at":"2026-05-18T00:58:47.994948Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:47.994948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xlsMAe1vZoudDhbfksreLZLLrZ9bf/KsIy4cWOyXKQztBTWk/2v4/1eDa5yU0BOp+0aKfTMWSVyM3+KHVfSvBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:47.995843Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.0553","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10d8e83bf588179c97b81fd767b218d3fbc579666d32a93d6c0fde02c82e6a3b","sha256:082e5a53e0830f8fab70eb28eb8d06c8a58f03f7fe4f0c586893f66dac813878"],"state_sha256":"0d6451954135349a4e05a2407c8ec62f679e8f1dcc4b1f4799810dfff0849e3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQNXuQ3v5QIaCjMZmn1D2xeSWIrZN75LVKRpFjYLHpX/d2LpUx1u/HVqhraOJfKgMRfQIR/66NHwsALtCMkfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:40:58.635586Z","bundle_sha256":"b6bf777849442820b218ef3a0b9e7cd8b21a92f2cecc04120b7167a0450157b0"}}