{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AKZOPRK6U3U4K63CXGJSCKU54V","short_pith_number":"pith:AKZOPRK6","canonical_record":{"source":{"id":"1203.0536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-02T17:57:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"912d86a7a0df3113b235938858677c43f5b6b63ace2392276ba8547f01ba583e","abstract_canon_sha256":"f53bf163e411e1c08d123e60327176d8ae89b2935ef67913bcd10dd2f033384a"},"schema_version":"1.0"},"canonical_sha256":"02b2e7c55ea6e9c57b62b993212a9de56ca1692fb02c89a3bc9445dd4865ef63","source":{"kind":"arxiv","id":"1203.0536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0536","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0536v1","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0536","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"AKZOPRK6U3U4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AKZOPRK6U3U4K63C","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AKZOPRK6","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AKZOPRK6U3U4K63CXGJSCKU54V","target":"record","payload":{"canonical_record":{"source":{"id":"1203.0536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-02T17:57:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"912d86a7a0df3113b235938858677c43f5b6b63ace2392276ba8547f01ba583e","abstract_canon_sha256":"f53bf163e411e1c08d123e60327176d8ae89b2935ef67913bcd10dd2f033384a"},"schema_version":"1.0"},"canonical_sha256":"02b2e7c55ea6e9c57b62b993212a9de56ca1692fb02c89a3bc9445dd4865ef63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.333248Z","signature_b64":"AItA9KoLCaByUYboj48y2hpRJnlxVai/EktpwMNUepf1F4/50o5a0NSgyMLU7UdUDov9ue9EFzeEkbUEVhPCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02b2e7c55ea6e9c57b62b993212a9de56ca1692fb02c89a3bc9445dd4865ef63","last_reissued_at":"2026-05-18T02:21:17.332544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.332544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.0536","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-18T02:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9RCE8D7WwzWWz/+AyMrfAPG0Q4zrv0Y08iM5kD2nLQCSVeHRJIvc9UQesKOc/MVLtkaC2EV9OZxt7iBo7tAXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:54:03.786583Z"},"content_sha256":"651bd55be4feb3612fc4495a2ca5c76c85f44e924ebcceabdc01b9d71be82790","schema_version":"1.0","event_id":"sha256:651bd55be4feb3612fc4495a2ca5c76c85f44e924ebcceabdc01b9d71be82790"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AKZOPRK6U3U4K63CXGJSCKU54V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Wireless Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Magn\\'us M. Halld\\'orsson, Olga Goussevskaia, Roger Wattenhofer","submitted_at":"2012-03-02T17:57:20Z","abstract_excerpt":"In this paper we address two basic questions in wireless communication: First, how long does it take to schedule an arbitrary set of communication requests? Second, given a set of communication requests, how many of them can be scheduled concurrently? Our results are derived in an interference model with geometric path loss and consist of efficient algorithms that find a constant approximation for the second problem and a logarithmic approximation for the first problem. In addition, we analyze some important properties of the interference model and show that it is robust to various factors tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0536","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-18T02:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCU6DSioTyZ+/RdkG+D2BTPxxm6MqvOp3wS5hsY4xPJiK1iZdOlIH4a1DhbixYuYo3ewUVUmzB1v3momIM5RAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:54:03.786923Z"},"content_sha256":"05b5ba6fe08828ca8b5dca45fa1ab7eac0927ed5459e75c4e0a62927e4073d48","schema_version":"1.0","event_id":"sha256:05b5ba6fe08828ca8b5dca45fa1ab7eac0927ed5459e75c4e0a62927e4073d48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKZOPRK6U3U4K63CXGJSCKU54V/bundle.json","state_url":"https://pith.science/pith/AKZOPRK6U3U4K63CXGJSCKU54V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKZOPRK6U3U4K63CXGJSCKU54V/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-01T19:54:03Z","links":{"resolver":"https://pith.science/pith/AKZOPRK6U3U4K63CXGJSCKU54V","bundle":"https://pith.science/pith/AKZOPRK6U3U4K63CXGJSCKU54V/bundle.json","state":"https://pith.science/pith/AKZOPRK6U3U4K63CXGJSCKU54V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKZOPRK6U3U4K63CXGJSCKU54V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AKZOPRK6U3U4K63CXGJSCKU54V","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":"f53bf163e411e1c08d123e60327176d8ae89b2935ef67913bcd10dd2f033384a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-02T17:57:20Z","title_canon_sha256":"912d86a7a0df3113b235938858677c43f5b6b63ace2392276ba8547f01ba583e"},"schema_version":"1.0","source":{"id":"1203.0536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0536","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0536v1","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0536","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"AKZOPRK6U3U4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AKZOPRK6U3U4K63C","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AKZOPRK6","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:05b5ba6fe08828ca8b5dca45fa1ab7eac0927ed5459e75c4e0a62927e4073d48","target":"graph","created_at":"2026-05-18T02:21:17Z","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":"In this paper we address two basic questions in wireless communication: First, how long does it take to schedule an arbitrary set of communication requests? Second, given a set of communication requests, how many of them can be scheduled concurrently? Our results are derived in an interference model with geometric path loss and consist of efficient algorithms that find a constant approximation for the second problem and a logarithmic approximation for the first problem. In addition, we analyze some important properties of the interference model and show that it is robust to various factors tha","authors_text":"Magn\\'us M. Halld\\'orsson, Olga Goussevskaia, Roger Wattenhofer","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-02T17:57:20Z","title":"Algorithms for Wireless Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0536","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:651bd55be4feb3612fc4495a2ca5c76c85f44e924ebcceabdc01b9d71be82790","target":"record","created_at":"2026-05-18T02:21:17Z","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":"f53bf163e411e1c08d123e60327176d8ae89b2935ef67913bcd10dd2f033384a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-02T17:57:20Z","title_canon_sha256":"912d86a7a0df3113b235938858677c43f5b6b63ace2392276ba8547f01ba583e"},"schema_version":"1.0","source":{"id":"1203.0536","kind":"arxiv","version":1}},"canonical_sha256":"02b2e7c55ea6e9c57b62b993212a9de56ca1692fb02c89a3bc9445dd4865ef63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02b2e7c55ea6e9c57b62b993212a9de56ca1692fb02c89a3bc9445dd4865ef63","first_computed_at":"2026-05-18T02:21:17.332544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:17.332544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AItA9KoLCaByUYboj48y2hpRJnlxVai/EktpwMNUepf1F4/50o5a0NSgyMLU7UdUDov9ue9EFzeEkbUEVhPCCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:17.333248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:651bd55be4feb3612fc4495a2ca5c76c85f44e924ebcceabdc01b9d71be82790","sha256:05b5ba6fe08828ca8b5dca45fa1ab7eac0927ed5459e75c4e0a62927e4073d48"],"state_sha256":"9e90d80ae6ff947d7e69f54e1c322a1c3376dfe0269e4b3ca16ab1c54162ca97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZ4MYJfugUCxTjtS8cmfP76G5e++yX8Q1TePIJ2cQ3GOAq9OTr6YLccXEXBEBGOqoIGZQgY+4b3QZrRyqlyqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:54:03.788787Z","bundle_sha256":"79de57ad1271026275bcfa63002c4c6cc12d2bc1334df0bdfc9638029e086f8f"}}