{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:67EK6VA5B67NI5JDYZJKPUZ74I","short_pith_number":"pith:67EK6VA5","canonical_record":{"source":{"id":"0906.0531","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-06-02T16:43:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b4c84d1402a026b50c42b3b1c62fef3101474717c16c3fbc757f3cf4a224e41e","abstract_canon_sha256":"46a82cc26e4447a71521787b46cada07aa28476fba6f8babece636c9bd012619"},"schema_version":"1.0"},"canonical_sha256":"f7c8af541d0fbed47523c652a7d33fe22b10770105efea017c8f52548319b1b2","source":{"kind":"arxiv","id":"0906.0531","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.0531","created_at":"2026-05-18T04:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"0906.0531v2","created_at":"2026-05-18T04:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0531","created_at":"2026-05-18T04:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"67EK6VA5B67N","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"67EK6VA5B67NI5JD","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"67EK6VA5","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:67EK6VA5B67NI5JDYZJKPUZ74I","target":"record","payload":{"canonical_record":{"source":{"id":"0906.0531","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-06-02T16:43:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b4c84d1402a026b50c42b3b1c62fef3101474717c16c3fbc757f3cf4a224e41e","abstract_canon_sha256":"46a82cc26e4447a71521787b46cada07aa28476fba6f8babece636c9bd012619"},"schema_version":"1.0"},"canonical_sha256":"f7c8af541d0fbed47523c652a7d33fe22b10770105efea017c8f52548319b1b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:44.714278Z","signature_b64":"bt0GWexGHAyEbC9g02/8TDwZO3ImdjKFl+XbRY7vmSWUVnbdqDTV++/OIm0G/A0a01bs4bTg+5Yf5N94SeW1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7c8af541d0fbed47523c652a7d33fe22b10770105efea017c8f52548319b1b2","last_reissued_at":"2026-05-18T04:42:44.713829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:44.713829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.0531","source_version":2,"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-18T04:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZvAtO9xCNM2ER27SF+2u4TOjJEWiE9ZGEFnz6/nIUk/EDKagISYZu1t0GVhuvMj5T9K9A9N8XmD3d7QCZfCwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:40:20.305201Z"},"content_sha256":"8b55a391a22c4362471c95eb245d2e4bee83f4731c9f53726d8fc165e256a316","schema_version":"1.0","event_id":"sha256:8b55a391a22c4362471c95eb245d2e4bee83f4731c9f53726d8fc165e256a316"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:67EK6VA5B67NI5JDYZJKPUZ74I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Medium Access Control Protocols With Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Jaeok Park, Mihaela van der Schaar","submitted_at":"2009-06-02T16:43:16Z","abstract_excerpt":"Many existing medium access control (MAC) protocols utilize past information (e.g., the results of transmission attempts) to adjust the transmission parameters of users. This paper provides a general framework to express and evaluate distributed MAC protocols utilizing a finite length of memory for a given form of feedback information. We define protocols with memory in the context of a slotted random access network with saturated arrivals. We introduce two performance metrics, throughput and average delay, and formulate the problem of finding an optimal protocol. We first show that a TDMA out"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0531","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":""},"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-18T04:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxbqYrtEEnVQdylYfvQg44sSna+QbKNZe9NGVDy+sGsOWY2tW+oRBGA3FWsaFQcCG8HiuDo0FYfwv08JnO5sDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:40:20.305922Z"},"content_sha256":"3085eb50959f29ab7446eff613b9fcb10301bbb55b93b610752ffcb492ca380c","schema_version":"1.0","event_id":"sha256:3085eb50959f29ab7446eff613b9fcb10301bbb55b93b610752ffcb492ca380c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67EK6VA5B67NI5JDYZJKPUZ74I/bundle.json","state_url":"https://pith.science/pith/67EK6VA5B67NI5JDYZJKPUZ74I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67EK6VA5B67NI5JDYZJKPUZ74I/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-07T18:40:20Z","links":{"resolver":"https://pith.science/pith/67EK6VA5B67NI5JDYZJKPUZ74I","bundle":"https://pith.science/pith/67EK6VA5B67NI5JDYZJKPUZ74I/bundle.json","state":"https://pith.science/pith/67EK6VA5B67NI5JDYZJKPUZ74I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67EK6VA5B67NI5JDYZJKPUZ74I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:67EK6VA5B67NI5JDYZJKPUZ74I","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":"46a82cc26e4447a71521787b46cada07aa28476fba6f8babece636c9bd012619","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-06-02T16:43:16Z","title_canon_sha256":"b4c84d1402a026b50c42b3b1c62fef3101474717c16c3fbc757f3cf4a224e41e"},"schema_version":"1.0","source":{"id":"0906.0531","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.0531","created_at":"2026-05-18T04:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"0906.0531v2","created_at":"2026-05-18T04:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0531","created_at":"2026-05-18T04:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"67EK6VA5B67N","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"67EK6VA5B67NI5JD","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"67EK6VA5","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:3085eb50959f29ab7446eff613b9fcb10301bbb55b93b610752ffcb492ca380c","target":"graph","created_at":"2026-05-18T04:42:44Z","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":"Many existing medium access control (MAC) protocols utilize past information (e.g., the results of transmission attempts) to adjust the transmission parameters of users. This paper provides a general framework to express and evaluate distributed MAC protocols utilizing a finite length of memory for a given form of feedback information. We define protocols with memory in the context of a slotted random access network with saturated arrivals. We introduce two performance metrics, throughput and average delay, and formulate the problem of finding an optimal protocol. We first show that a TDMA out","authors_text":"Jaeok Park, Mihaela van der Schaar","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-06-02T16:43:16Z","title":"Medium Access Control Protocols With Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0531","kind":"arxiv","version":2},"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:8b55a391a22c4362471c95eb245d2e4bee83f4731c9f53726d8fc165e256a316","target":"record","created_at":"2026-05-18T04:42:44Z","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":"46a82cc26e4447a71521787b46cada07aa28476fba6f8babece636c9bd012619","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-06-02T16:43:16Z","title_canon_sha256":"b4c84d1402a026b50c42b3b1c62fef3101474717c16c3fbc757f3cf4a224e41e"},"schema_version":"1.0","source":{"id":"0906.0531","kind":"arxiv","version":2}},"canonical_sha256":"f7c8af541d0fbed47523c652a7d33fe22b10770105efea017c8f52548319b1b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7c8af541d0fbed47523c652a7d33fe22b10770105efea017c8f52548319b1b2","first_computed_at":"2026-05-18T04:42:44.713829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:44.713829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bt0GWexGHAyEbC9g02/8TDwZO3ImdjKFl+XbRY7vmSWUVnbdqDTV++/OIm0G/A0a01bs4bTg+5Yf5N94SeW1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:44.714278Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.0531","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b55a391a22c4362471c95eb245d2e4bee83f4731c9f53726d8fc165e256a316","sha256:3085eb50959f29ab7446eff613b9fcb10301bbb55b93b610752ffcb492ca380c"],"state_sha256":"3692aae0c2404c1aa4092edfb87c38f651d1f42bc73225a4b80f308d454f6859"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qUWZ0nlsBFDz822XO5cS0Xb8ZtePtW38tXzo8b2Hzi25P5qegNyqf4xlwRF4EENBafM6yDING2HulDnndiZaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:40:20.309610Z","bundle_sha256":"022cba9103edc63f873a6537631ec65563d60d45d4212584ea751a00e157a8ca"}}