{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PEICDED67Q4I65I26I2QQPATAW","short_pith_number":"pith:PEICDED6","canonical_record":{"source":{"id":"1107.3199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-16T05:09:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e15067d52d88ca1ec085a8e74503ebf94f1f3b5d87c5b7ad89f69c257dd9967","abstract_canon_sha256":"f64ecba89f62eb26089c0bcf87d98198e5ec910e525e2c2ff46680d7e518de84"},"schema_version":"1.0"},"canonical_sha256":"791021907efc388f751af235083c13058ce8e9f1af8a62f14687dbce356dbe79","source":{"kind":"arxiv","id":"1107.3199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3199","created_at":"2026-05-18T04:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3199v1","created_at":"2026-05-18T04:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3199","created_at":"2026-05-18T04:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"PEICDED67Q4I","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PEICDED67Q4I65I2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PEICDED6","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PEICDED67Q4I65I26I2QQPATAW","target":"record","payload":{"canonical_record":{"source":{"id":"1107.3199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-16T05:09:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e15067d52d88ca1ec085a8e74503ebf94f1f3b5d87c5b7ad89f69c257dd9967","abstract_canon_sha256":"f64ecba89f62eb26089c0bcf87d98198e5ec910e525e2c2ff46680d7e518de84"},"schema_version":"1.0"},"canonical_sha256":"791021907efc388f751af235083c13058ce8e9f1af8a62f14687dbce356dbe79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:03.679163Z","signature_b64":"DxdhP/Gtp2fw0myM2KnzR4guSJA526b0uxM+3MJyJRCVv9c8d8yUay4FjX1Q1h5HP6K4tRreSev+tmT7f3jWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"791021907efc388f751af235083c13058ce8e9f1af8a62f14687dbce356dbe79","last_reissued_at":"2026-05-18T04:18:03.678628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:03.678628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.3199","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-18T04:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bfr5BH2+UxnH97xCauJWsZo/K4Y8K6Xu6HaMsrAxQ7mvBQuc4ulw58V/GnvYvvsF/EAUM7XhMNZzzP4scjRCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:38:50.547542Z"},"content_sha256":"2ea8df197d9e45d633a58ef96fe1be197a3bd70422304498127b9e8120770ef5","schema_version":"1.0","event_id":"sha256:2ea8df197d9e45d633a58ef96fe1be197a3bd70422304498127b9e8120770ef5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PEICDED67Q4I65I26I2QQPATAW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Guarantee under Longest-Queue-First Schedule in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Li, Cem Boyaci, Ye Xia","submitted_at":"2011-07-16T05:09:07Z","abstract_excerpt":"Efficient link scheduling in a wireless network is challenging. Typical optimal algorithms require solving an NP-hard sub-problem. To meet the challenge, one stream of research focuses on finding simpler sub-optimal algorithms that have low complexity but high efficiency in practice. In this paper, we study the performance guarantee of one such scheduling algorithm, the Longest-Queue-First (LQF) algorithm. It is known that the LQF algorithm achieves the full capacity region, $\\Lambda$, when the interference graph satisfies the so-called local pooling condition. For a general graph $G$, LQF ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3199","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-18T04:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXX2myX975GGfA/9ypZS92Dn6vC5ux+2w0U0ZxmI/0dpekAkreLI6F44WHO+Z1ME3lp8xg+oeXj1UljCx3zgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:38:50.548172Z"},"content_sha256":"4881b5b6045e02ed8afcc122e415f048b7a87e09624c23b49515427915c6cbf2","schema_version":"1.0","event_id":"sha256:4881b5b6045e02ed8afcc122e415f048b7a87e09624c23b49515427915c6cbf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PEICDED67Q4I65I26I2QQPATAW/bundle.json","state_url":"https://pith.science/pith/PEICDED67Q4I65I26I2QQPATAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PEICDED67Q4I65I26I2QQPATAW/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-25T19:38:50Z","links":{"resolver":"https://pith.science/pith/PEICDED67Q4I65I26I2QQPATAW","bundle":"https://pith.science/pith/PEICDED67Q4I65I26I2QQPATAW/bundle.json","state":"https://pith.science/pith/PEICDED67Q4I65I26I2QQPATAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PEICDED67Q4I65I26I2QQPATAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PEICDED67Q4I65I26I2QQPATAW","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":"f64ecba89f62eb26089c0bcf87d98198e5ec910e525e2c2ff46680d7e518de84","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-16T05:09:07Z","title_canon_sha256":"7e15067d52d88ca1ec085a8e74503ebf94f1f3b5d87c5b7ad89f69c257dd9967"},"schema_version":"1.0","source":{"id":"1107.3199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3199","created_at":"2026-05-18T04:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3199v1","created_at":"2026-05-18T04:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3199","created_at":"2026-05-18T04:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"PEICDED67Q4I","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PEICDED67Q4I65I2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PEICDED6","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:4881b5b6045e02ed8afcc122e415f048b7a87e09624c23b49515427915c6cbf2","target":"graph","created_at":"2026-05-18T04:18:03Z","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":"Efficient link scheduling in a wireless network is challenging. Typical optimal algorithms require solving an NP-hard sub-problem. To meet the challenge, one stream of research focuses on finding simpler sub-optimal algorithms that have low complexity but high efficiency in practice. In this paper, we study the performance guarantee of one such scheduling algorithm, the Longest-Queue-First (LQF) algorithm. It is known that the LQF algorithm achieves the full capacity region, $\\Lambda$, when the interference graph satisfies the so-called local pooling condition. For a general graph $G$, LQF ach","authors_text":"Bo Li, Cem Boyaci, Ye Xia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-16T05:09:07Z","title":"Performance Guarantee under Longest-Queue-First Schedule in Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3199","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:2ea8df197d9e45d633a58ef96fe1be197a3bd70422304498127b9e8120770ef5","target":"record","created_at":"2026-05-18T04:18:03Z","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":"f64ecba89f62eb26089c0bcf87d98198e5ec910e525e2c2ff46680d7e518de84","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-16T05:09:07Z","title_canon_sha256":"7e15067d52d88ca1ec085a8e74503ebf94f1f3b5d87c5b7ad89f69c257dd9967"},"schema_version":"1.0","source":{"id":"1107.3199","kind":"arxiv","version":1}},"canonical_sha256":"791021907efc388f751af235083c13058ce8e9f1af8a62f14687dbce356dbe79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"791021907efc388f751af235083c13058ce8e9f1af8a62f14687dbce356dbe79","first_computed_at":"2026-05-18T04:18:03.678628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:03.678628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DxdhP/Gtp2fw0myM2KnzR4guSJA526b0uxM+3MJyJRCVv9c8d8yUay4FjX1Q1h5HP6K4tRreSev+tmT7f3jWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:03.679163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ea8df197d9e45d633a58ef96fe1be197a3bd70422304498127b9e8120770ef5","sha256:4881b5b6045e02ed8afcc122e415f048b7a87e09624c23b49515427915c6cbf2"],"state_sha256":"2b3102b2fe65cb041c4b2520d71c41a4ac8aff27ab05a6ebec90643508f42d2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1r5/lg/yuQfqtFAlZRM3La0ebjVOGlnQqcXOewqwH7HwpYN+e88FZ0d+Mj4RwPwm+PM4UjRdSJhXtARSCA/YAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:38:50.551307Z","bundle_sha256":"6272f4b010be70147d7a71592d65328ba988c58cf664c23cc93a849bfadb154b"}}