{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NXHXLYPF35TRPSCZKOY7I27BT3","short_pith_number":"pith:NXHXLYPF","canonical_record":{"source":{"id":"1111.5200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-22T14:08:44Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"881cabb8f86be9f796598f1382195de73614e3475a176b5f8e22713b1ee973d8","abstract_canon_sha256":"73ca5b536e8b3ad93b3b0ddbb530bc9551844c7760aeead796bf644aa123cabc"},"schema_version":"1.0"},"canonical_sha256":"6dcf75e1e5df6717c85953b1f46be19ed44c969a4a2eba46d7aacf1225b99875","source":{"kind":"arxiv","id":"1111.5200","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5200","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5200v2","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5200","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"NXHXLYPF35TR","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NXHXLYPF35TRPSCZ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NXHXLYPF","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NXHXLYPF35TRPSCZKOY7I27BT3","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-22T14:08:44Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"881cabb8f86be9f796598f1382195de73614e3475a176b5f8e22713b1ee973d8","abstract_canon_sha256":"73ca5b536e8b3ad93b3b0ddbb530bc9551844c7760aeead796bf644aa123cabc"},"schema_version":"1.0"},"canonical_sha256":"6dcf75e1e5df6717c85953b1f46be19ed44c969a4a2eba46d7aacf1225b99875","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:16.684960Z","signature_b64":"AaWyrdE+X2/D/MD/9pjR75DxZF66hup61s531zoa8fXr1Yj6SyQGXVSoU8TSPJ5K7GHHiX+DGSkKJXBC9WvZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dcf75e1e5df6717c85953b1f46be19ed44c969a4a2eba46d7aacf1225b99875","last_reissued_at":"2026-05-18T04:04:16.684162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:16.684162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5200","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:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+0FbArtuLs2yKGFrQbhHMkN5qTaK/tgkRTBHgJOi4r2gE1sX6SzVvdENxWUfwHsy82SU8TwYe3//fPITW39CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:25:08.120020Z"},"content_sha256":"4d10a7759646b7969e86746f7668b433e4aeddcc7ddc37ad48e6f912d6db6451","schema_version":"1.0","event_id":"sha256:4d10a7759646b7969e86746f7668b433e4aeddcc7ddc37ad48e6f912d6db6451"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NXHXLYPF35TRPSCZKOY7I27BT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wireless Capacity and Admission Control in Cognitive Radio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","submitted_at":"2011-11-22T14:08:44Z","abstract_excerpt":"We give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulation for capacity problems. First, we give a new constant-factor approximation algorithm for selecting the maximum subset of links that can be scheduled simultaneously, under any non-decreasing and sublinear power assignment. For the case of uniform power, we extend this to the case of variable QoS requirements and link-dependent noise terms. Second, we approximate a problem related to cognitive radio: find a maximum se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5200","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:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6XLx6GMLPCXvj1GBIpL2fpD24Oidm2hN6H/QX9RCSl26emXO9bTvLZ1peneAiUk0njvM34YvzIuXsowPJ5jBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:25:08.120679Z"},"content_sha256":"27556917f6788f8e6a7c13f13dece9fcc3f414ac01c4e99194731fc0f099acc3","schema_version":"1.0","event_id":"sha256:27556917f6788f8e6a7c13f13dece9fcc3f414ac01c4e99194731fc0f099acc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3/bundle.json","state_url":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXHXLYPF35TRPSCZKOY7I27BT3/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-05T15:25:08Z","links":{"resolver":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3","bundle":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3/bundle.json","state":"https://pith.science/pith/NXHXLYPF35TRPSCZKOY7I27BT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXHXLYPF35TRPSCZKOY7I27BT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NXHXLYPF35TRPSCZKOY7I27BT3","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":"73ca5b536e8b3ad93b3b0ddbb530bc9551844c7760aeead796bf644aa123cabc","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-22T14:08:44Z","title_canon_sha256":"881cabb8f86be9f796598f1382195de73614e3475a176b5f8e22713b1ee973d8"},"schema_version":"1.0","source":{"id":"1111.5200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5200","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5200v2","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5200","created_at":"2026-05-18T04:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"NXHXLYPF35TR","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NXHXLYPF35TRPSCZ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NXHXLYPF","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:27556917f6788f8e6a7c13f13dece9fcc3f414ac01c4e99194731fc0f099acc3","target":"graph","created_at":"2026-05-18T04:04:16Z","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 give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulation for capacity problems. First, we give a new constant-factor approximation algorithm for selecting the maximum subset of links that can be scheduled simultaneously, under any non-decreasing and sublinear power assignment. For the case of uniform power, we extend this to the case of variable QoS requirements and link-dependent noise terms. Second, we approximate a problem related to cognitive radio: find a maximum se","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-22T14:08:44Z","title":"Wireless Capacity and Admission Control in Cognitive Radio"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5200","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:4d10a7759646b7969e86746f7668b433e4aeddcc7ddc37ad48e6f912d6db6451","target":"record","created_at":"2026-05-18T04:04:16Z","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":"73ca5b536e8b3ad93b3b0ddbb530bc9551844c7760aeead796bf644aa123cabc","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-22T14:08:44Z","title_canon_sha256":"881cabb8f86be9f796598f1382195de73614e3475a176b5f8e22713b1ee973d8"},"schema_version":"1.0","source":{"id":"1111.5200","kind":"arxiv","version":2}},"canonical_sha256":"6dcf75e1e5df6717c85953b1f46be19ed44c969a4a2eba46d7aacf1225b99875","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dcf75e1e5df6717c85953b1f46be19ed44c969a4a2eba46d7aacf1225b99875","first_computed_at":"2026-05-18T04:04:16.684162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:16.684162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AaWyrdE+X2/D/MD/9pjR75DxZF66hup61s531zoa8fXr1Yj6SyQGXVSoU8TSPJ5K7GHHiX+DGSkKJXBC9WvZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:16.684960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d10a7759646b7969e86746f7668b433e4aeddcc7ddc37ad48e6f912d6db6451","sha256:27556917f6788f8e6a7c13f13dece9fcc3f414ac01c4e99194731fc0f099acc3"],"state_sha256":"58b7fabb16290b70fe69cf4e60fc48514c8f9b087a23877776575310e08fca55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1mApQzjFf/urrFgH6484LxYh7I+Ri3diupAnR5PlzNeNB+h/wOtYfulrWc7fdVOeGtrRJvYh3pW9ZZUTetAZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:25:08.140423Z","bundle_sha256":"dd0bbecaef2db1739b11180784c847ad1d68a58561ab1fc05583d3ed075122f6"}}