{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DRVBAWJRQ66LGFDKOWHFAHOB6N","short_pith_number":"pith:DRVBAWJR","canonical_record":{"source":{"id":"1602.00883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T11:22:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"540d6f1463e3466b41d1d5bb17f543dfc9da8920fbe366ce6aeeea0fd7806172","abstract_canon_sha256":"bd42b4e4c65f79ff2b5b9a724efb3ac12a8c88884dfd026fe65a6c601717ac6f"},"schema_version":"1.0"},"canonical_sha256":"1c6a10593187bcb3146a758e501dc1f3639d32fc0da28a0fed5d78290e82bae0","source":{"kind":"arxiv","id":"1602.00883","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00883","created_at":"2026-05-18T00:56:31Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00883v2","created_at":"2026-05-18T00:56:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00883","created_at":"2026-05-18T00:56:31Z"},{"alias_kind":"pith_short_12","alias_value":"DRVBAWJRQ66L","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRVBAWJRQ66LGFDK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRVBAWJR","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DRVBAWJRQ66LGFDKOWHFAHOB6N","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T11:22:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"540d6f1463e3466b41d1d5bb17f543dfc9da8920fbe366ce6aeeea0fd7806172","abstract_canon_sha256":"bd42b4e4c65f79ff2b5b9a724efb3ac12a8c88884dfd026fe65a6c601717ac6f"},"schema_version":"1.0"},"canonical_sha256":"1c6a10593187bcb3146a758e501dc1f3639d32fc0da28a0fed5d78290e82bae0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:31.349099Z","signature_b64":"wXvJbbgjg+RERwgKzokSXfpJ8515FFcIqydMxs3XRurjIqD0JBGOoqToQ4bg14SlakjuubYN7rLunLzYR8a3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c6a10593187bcb3146a758e501dc1f3639d32fc0da28a0fed5d78290e82bae0","last_reissued_at":"2026-05-18T00:56:31.348361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:31.348361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00883","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-18T00:56:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3RA8cPgJJgtH3g9hK3a5dJuvUPU5HhWBtj+Dfarql2V8Jx24fcodmXDS5KvwUUFPRcQL+he7aE4ETAwuKrPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:21:26.623678Z"},"content_sha256":"408f6e5c2bd526d116a6ea977d21923940c62049a31cb3be31784805ec0b9727","schema_version":"1.0","event_id":"sha256:408f6e5c2bd526d116a6ea977d21923940c62049a31cb3be31784805ec0b9727"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DRVBAWJRQ66LGFDKOWHFAHOB6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Scheduling in Multiple Access with Bursty Arrivals and Delay Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sakshi Kapoor, Sibi Raj B Pillai, Sreejith Sreekumar","submitted_at":"2016-02-02T11:22:25Z","abstract_excerpt":"A multiple access system with bursty data arrivals to the terminals is considered. The users are frame-synchronized, with variable sized packets independently arriving in each slot at every transmitter. Each packet needs to be delivered to a common receiver within a certain number of slots specified by a maximum delay constraint. The key assumption is that the terminals know only their own packet arrival process, i.e. the arrivals at the rest of the terminals are unknown to each transmitter, except for their statistics. For this interesting distributed multiple access model, we design novel on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00883","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-18T00:56:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RpnE5+q2237zd87vk6oU6KkJCRtX7mZ9yU5xz7bP6lIuc4Pj/1li2Mk+yyyrAL71flv2nBVIdQKLxo0MJ7uZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:21:26.624462Z"},"content_sha256":"ef7e09a2ff0034c1b6025b3da99ceede2ebd3973820e053ba0e249be72e2f85b","schema_version":"1.0","event_id":"sha256:ef7e09a2ff0034c1b6025b3da99ceede2ebd3973820e053ba0e249be72e2f85b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRVBAWJRQ66LGFDKOWHFAHOB6N/bundle.json","state_url":"https://pith.science/pith/DRVBAWJRQ66LGFDKOWHFAHOB6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRVBAWJRQ66LGFDKOWHFAHOB6N/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-26T03:21:26Z","links":{"resolver":"https://pith.science/pith/DRVBAWJRQ66LGFDKOWHFAHOB6N","bundle":"https://pith.science/pith/DRVBAWJRQ66LGFDKOWHFAHOB6N/bundle.json","state":"https://pith.science/pith/DRVBAWJRQ66LGFDKOWHFAHOB6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRVBAWJRQ66LGFDKOWHFAHOB6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DRVBAWJRQ66LGFDKOWHFAHOB6N","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":"bd42b4e4c65f79ff2b5b9a724efb3ac12a8c88884dfd026fe65a6c601717ac6f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T11:22:25Z","title_canon_sha256":"540d6f1463e3466b41d1d5bb17f543dfc9da8920fbe366ce6aeeea0fd7806172"},"schema_version":"1.0","source":{"id":"1602.00883","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00883","created_at":"2026-05-18T00:56:31Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00883v2","created_at":"2026-05-18T00:56:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00883","created_at":"2026-05-18T00:56:31Z"},{"alias_kind":"pith_short_12","alias_value":"DRVBAWJRQ66L","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRVBAWJRQ66LGFDK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRVBAWJR","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:ef7e09a2ff0034c1b6025b3da99ceede2ebd3973820e053ba0e249be72e2f85b","target":"graph","created_at":"2026-05-18T00:56:31Z","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":"A multiple access system with bursty data arrivals to the terminals is considered. The users are frame-synchronized, with variable sized packets independently arriving in each slot at every transmitter. Each packet needs to be delivered to a common receiver within a certain number of slots specified by a maximum delay constraint. The key assumption is that the terminals know only their own packet arrival process, i.e. the arrivals at the rest of the terminals are unknown to each transmitter, except for their statistics. For this interesting distributed multiple access model, we design novel on","authors_text":"Sakshi Kapoor, Sibi Raj B Pillai, Sreejith Sreekumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T11:22:25Z","title":"Distributed Scheduling in Multiple Access with Bursty Arrivals and Delay Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00883","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:408f6e5c2bd526d116a6ea977d21923940c62049a31cb3be31784805ec0b9727","target":"record","created_at":"2026-05-18T00:56:31Z","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":"bd42b4e4c65f79ff2b5b9a724efb3ac12a8c88884dfd026fe65a6c601717ac6f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-02T11:22:25Z","title_canon_sha256":"540d6f1463e3466b41d1d5bb17f543dfc9da8920fbe366ce6aeeea0fd7806172"},"schema_version":"1.0","source":{"id":"1602.00883","kind":"arxiv","version":2}},"canonical_sha256":"1c6a10593187bcb3146a758e501dc1f3639d32fc0da28a0fed5d78290e82bae0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c6a10593187bcb3146a758e501dc1f3639d32fc0da28a0fed5d78290e82bae0","first_computed_at":"2026-05-18T00:56:31.348361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:31.348361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wXvJbbgjg+RERwgKzokSXfpJ8515FFcIqydMxs3XRurjIqD0JBGOoqToQ4bg14SlakjuubYN7rLunLzYR8a3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:31.349099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00883","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:408f6e5c2bd526d116a6ea977d21923940c62049a31cb3be31784805ec0b9727","sha256:ef7e09a2ff0034c1b6025b3da99ceede2ebd3973820e053ba0e249be72e2f85b"],"state_sha256":"3bee9dcf76eefe26a85dbd1dcdff1af46dcc5fe26472ce10d77d647284d0fff8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTHgLD51gQ+AAGeekp/qxMpbz8ZOxhoZRMHnuJxYQoa36dF0xqE2Zud5z3s0wMneVe02ol/PwH1DMB4eWG0xBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:21:26.628326Z","bundle_sha256":"a6239c79667449e11268f47197bfbe789a9ef3c10b15b882c777fa34fd1f78b2"}}