{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IQ7R5QSSKOZWKAITNOTDXGSG5I","short_pith_number":"pith:IQ7R5QSS","canonical_record":{"source":{"id":"1302.5945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-24T19:49:00Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"1194c86114f926c7e7b9586890a339e78ff1e55a3f1acb43d81a298711bcd90b","abstract_canon_sha256":"73351b11896bb66503e5af3bca3c3c3adb62327bd69d211f84a4afbc4c0fba26"},"schema_version":"1.0"},"canonical_sha256":"443f1ec25253b36501136ba63b9a46ea0a5abad119a8aea65e68ff62c6172d4a","source":{"kind":"arxiv","id":"1302.5945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5945","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5945v1","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5945","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"IQ7R5QSSKOZW","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IQ7R5QSSKOZWKAIT","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IQ7R5QSS","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IQ7R5QSSKOZWKAITNOTDXGSG5I","target":"record","payload":{"canonical_record":{"source":{"id":"1302.5945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-24T19:49:00Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"1194c86114f926c7e7b9586890a339e78ff1e55a3f1acb43d81a298711bcd90b","abstract_canon_sha256":"73351b11896bb66503e5af3bca3c3c3adb62327bd69d211f84a4afbc4c0fba26"},"schema_version":"1.0"},"canonical_sha256":"443f1ec25253b36501136ba63b9a46ea0a5abad119a8aea65e68ff62c6172d4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:33.165666Z","signature_b64":"Z0uc4efR9Q49Vat3BmHjxc1RUWKKsj9tl8qh9Z5W8vmZheI7TCORVQ6FgUqn2/JIS36+GbNMZk0CsycwEM8oDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"443f1ec25253b36501136ba63b9a46ea0a5abad119a8aea65e68ff62c6172d4a","last_reissued_at":"2026-05-18T03:32:33.164879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:33.164879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.5945","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-18T03:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UoLbD1r0JP3M/BUQ0EHWY054LmiVV2hg/U+EqB+Lh/Yyv9AyQ0T+Kg1y1ynbVzcOWb0XURa0uvx+fLb0ryJABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:21:48.120678Z"},"content_sha256":"31559bd4ff4de247be243badb8b325f09cba4cb5eb56b4eac46111af1b113eca","schema_version":"1.0","event_id":"sha256:31559bd4ff4de247be243badb8b325f09cba4cb5eb56b4eac46111af1b113eca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IQ7R5QSSKOZWKAITNOTDXGSG5I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"cs.NI","authors_text":"Javad Ghaderi, Phil Whiting, Sem Borst","submitted_at":"2013-02-24T19:49:00Z","abstract_excerpt":"We use fluid limits to explore the (in)stability properties of wireless networks with queue-based random-access algorithms. Queue-based random-access schemes are simple and inherently distributed in nature, yet provide the capability to match the optimal throughput performance of centralized scheduling mechanisms in a wide range of scenarios. Unfortunately, the type of activation rules for which throughput optimality has been established, may result in excessive queue lengths and delays. The use of more aggressive/persistent access schemes can improve the delay performance, but does not offer "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5945","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-18T03:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z9zrpWbuGgROoQAbyhn3+/pX4ANDHDVlJnvwzSjutu18lKTiaF6E0I6UGir9Ia3aEPKKmg1TyKpT/MNMQQdkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:21:48.121024Z"},"content_sha256":"53ce7d897e8f5dea0b83863c3818deeac31bdb5dd1d93f80ffede4acb87c9c03","schema_version":"1.0","event_id":"sha256:53ce7d897e8f5dea0b83863c3818deeac31bdb5dd1d93f80ffede4acb87c9c03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQ7R5QSSKOZWKAITNOTDXGSG5I/bundle.json","state_url":"https://pith.science/pith/IQ7R5QSSKOZWKAITNOTDXGSG5I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQ7R5QSSKOZWKAITNOTDXGSG5I/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-05-28T10:21:48Z","links":{"resolver":"https://pith.science/pith/IQ7R5QSSKOZWKAITNOTDXGSG5I","bundle":"https://pith.science/pith/IQ7R5QSSKOZWKAITNOTDXGSG5I/bundle.json","state":"https://pith.science/pith/IQ7R5QSSKOZWKAITNOTDXGSG5I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQ7R5QSSKOZWKAITNOTDXGSG5I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IQ7R5QSSKOZWKAITNOTDXGSG5I","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":"73351b11896bb66503e5af3bca3c3c3adb62327bd69d211f84a4afbc4c0fba26","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-24T19:49:00Z","title_canon_sha256":"1194c86114f926c7e7b9586890a339e78ff1e55a3f1acb43d81a298711bcd90b"},"schema_version":"1.0","source":{"id":"1302.5945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5945","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5945v1","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5945","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"IQ7R5QSSKOZW","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IQ7R5QSSKOZWKAIT","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IQ7R5QSS","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:53ce7d897e8f5dea0b83863c3818deeac31bdb5dd1d93f80ffede4acb87c9c03","target":"graph","created_at":"2026-05-18T03:32:33Z","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 use fluid limits to explore the (in)stability properties of wireless networks with queue-based random-access algorithms. Queue-based random-access schemes are simple and inherently distributed in nature, yet provide the capability to match the optimal throughput performance of centralized scheduling mechanisms in a wide range of scenarios. Unfortunately, the type of activation rules for which throughput optimality has been established, may result in excessive queue lengths and delays. The use of more aggressive/persistent access schemes can improve the delay performance, but does not offer ","authors_text":"Javad Ghaderi, Phil Whiting, Sem Borst","cross_cats":["cs.IT","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-24T19:49:00Z","title":"Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5945","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:31559bd4ff4de247be243badb8b325f09cba4cb5eb56b4eac46111af1b113eca","target":"record","created_at":"2026-05-18T03:32:33Z","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":"73351b11896bb66503e5af3bca3c3c3adb62327bd69d211f84a4afbc4c0fba26","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-24T19:49:00Z","title_canon_sha256":"1194c86114f926c7e7b9586890a339e78ff1e55a3f1acb43d81a298711bcd90b"},"schema_version":"1.0","source":{"id":"1302.5945","kind":"arxiv","version":1}},"canonical_sha256":"443f1ec25253b36501136ba63b9a46ea0a5abad119a8aea65e68ff62c6172d4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"443f1ec25253b36501136ba63b9a46ea0a5abad119a8aea65e68ff62c6172d4a","first_computed_at":"2026-05-18T03:32:33.164879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:33.164879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z0uc4efR9Q49Vat3BmHjxc1RUWKKsj9tl8qh9Z5W8vmZheI7TCORVQ6FgUqn2/JIS36+GbNMZk0CsycwEM8oDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:33.165666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31559bd4ff4de247be243badb8b325f09cba4cb5eb56b4eac46111af1b113eca","sha256:53ce7d897e8f5dea0b83863c3818deeac31bdb5dd1d93f80ffede4acb87c9c03"],"state_sha256":"b1c7c7bc0f3facf46ef9e18b856355b364c61a761a13de72e068b86abbaba0d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBpprC35rtXwJRRjlfydq8wLK+fJBNByCnZGuqX9iusiVOzvVz00COQgcb42e/FjaYT0wA/pHEEeAFpN8gCEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:21:48.123012Z","bundle_sha256":"5b31b0661bec28e52562fefac8813e197b10a1d797fab3320cc47ad22a63cdf8"}}