{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MTJ4UMBIVLPPJ4EL3CHB7YPKDY","short_pith_number":"pith:MTJ4UMBI","canonical_record":{"source":{"id":"1104.5200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T17:48:07Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"7cfbe1b4065786c3b781547187549670ce6e32689ce3057adb3eba70ea333519","abstract_canon_sha256":"431dd9af8fafa011347ce265d8715677be204961d9c70fe43fef68810609082b"},"schema_version":"1.0"},"canonical_sha256":"64d3ca3028aadef4f08bd88e1fe1ea1e25c9476b4bf8edde4c257e1f1561606d","source":{"kind":"arxiv","id":"1104.5200","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5200","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5200v2","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5200","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"MTJ4UMBIVLPP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MTJ4UMBIVLPPJ4EL","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MTJ4UMBI","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MTJ4UMBIVLPPJ4EL3CHB7YPKDY","target":"record","payload":{"canonical_record":{"source":{"id":"1104.5200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T17:48:07Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"7cfbe1b4065786c3b781547187549670ce6e32689ce3057adb3eba70ea333519","abstract_canon_sha256":"431dd9af8fafa011347ce265d8715677be204961d9c70fe43fef68810609082b"},"schema_version":"1.0"},"canonical_sha256":"64d3ca3028aadef4f08bd88e1fe1ea1e25c9476b4bf8edde4c257e1f1561606d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:49.769196Z","signature_b64":"rdKe8UKwvmZSiUQhunV/B/pOXzejQF1p2OC6nQ+II75iQs8NZg+RQ1xXKPeL+Z/nLRK+loOTOnu5hP6Jh5cCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64d3ca3028aadef4f08bd88e1fe1ea1e25c9476b4bf8edde4c257e1f1561606d","last_reissued_at":"2026-05-18T02:52:49.768751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:49.768751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.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-18T02:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvYq7McHIlBlYr/GwUYXtAaKl03TyVZKq8ym+GDlrRlQizb4ckBX4HNkKzfmtkM6JkYWSdU1Pep4kg5G9GB4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:53:13.289353Z"},"content_sha256":"6a583a0d209a5804ea2f051400ede6557ece48e046eb906ba95bd236ead337fe","schema_version":"1.0","event_id":"sha256:6a583a0d209a5804ea2f051400ede6557ece48e046eb906ba95bd236ead337fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MTJ4UMBIVLPPJ4EL3CHB7YPKDY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model","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-04-27T17:48:07Z","abstract_excerpt":"We study the wireless scheduling problem in the SINR model. More specifically, given a set of $n$ links, each a sender-receiver pair, we wish to partition (or \\emph{schedule}) the links into the minimum number of slots, each satisfying interference constraints allowing simultaneous transmission. In the basic problem, all senders transmit with the same uniform power.\n  We give a distributed $O(\\log n)$-approximation algorithm for the scheduling problem, matching the best ratio known for centralized algorithms. It holds in arbitrary metric space and for every length-monotone and sublinear power "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.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-18T02:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeQPtdHLXdaUQou/6XopoEFCAnLF5y9nkBPNN5PDb1hPTn0wCKxHTFFZGNp2my3luNWBbeET8NXNM2DLiSo8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:53:13.290035Z"},"content_sha256":"bc1918449dba4eede26edc343c2066f0fe7f254a14456866e47566c2586c3d5e","schema_version":"1.0","event_id":"sha256:bc1918449dba4eede26edc343c2066f0fe7f254a14456866e47566c2586c3d5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/bundle.json","state_url":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/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-05T17:53:13Z","links":{"resolver":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY","bundle":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/bundle.json","state":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MTJ4UMBIVLPPJ4EL3CHB7YPKDY","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":"431dd9af8fafa011347ce265d8715677be204961d9c70fe43fef68810609082b","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T17:48:07Z","title_canon_sha256":"7cfbe1b4065786c3b781547187549670ce6e32689ce3057adb3eba70ea333519"},"schema_version":"1.0","source":{"id":"1104.5200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5200","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5200v2","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5200","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"MTJ4UMBIVLPP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MTJ4UMBIVLPPJ4EL","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MTJ4UMBI","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:bc1918449dba4eede26edc343c2066f0fe7f254a14456866e47566c2586c3d5e","target":"graph","created_at":"2026-05-18T02:52:49Z","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 study the wireless scheduling problem in the SINR model. More specifically, given a set of $n$ links, each a sender-receiver pair, we wish to partition (or \\emph{schedule}) the links into the minimum number of slots, each satisfying interference constraints allowing simultaneous transmission. In the basic problem, all senders transmit with the same uniform power.\n  We give a distributed $O(\\log n)$-approximation algorithm for the scheduling problem, matching the best ratio known for centralized algorithms. It holds in arbitrary metric space and for every length-monotone and sublinear power ","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-04-27T17:48:07Z","title":"Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.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:6a583a0d209a5804ea2f051400ede6557ece48e046eb906ba95bd236ead337fe","target":"record","created_at":"2026-05-18T02:52:49Z","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":"431dd9af8fafa011347ce265d8715677be204961d9c70fe43fef68810609082b","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T17:48:07Z","title_canon_sha256":"7cfbe1b4065786c3b781547187549670ce6e32689ce3057adb3eba70ea333519"},"schema_version":"1.0","source":{"id":"1104.5200","kind":"arxiv","version":2}},"canonical_sha256":"64d3ca3028aadef4f08bd88e1fe1ea1e25c9476b4bf8edde4c257e1f1561606d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64d3ca3028aadef4f08bd88e1fe1ea1e25c9476b4bf8edde4c257e1f1561606d","first_computed_at":"2026-05-18T02:52:49.768751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:49.768751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rdKe8UKwvmZSiUQhunV/B/pOXzejQF1p2OC6nQ+II75iQs8NZg+RQ1xXKPeL+Z/nLRK+loOTOnu5hP6Jh5cCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:49.769196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.5200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a583a0d209a5804ea2f051400ede6557ece48e046eb906ba95bd236ead337fe","sha256:bc1918449dba4eede26edc343c2066f0fe7f254a14456866e47566c2586c3d5e"],"state_sha256":"901d1d409d2510a4913d67b977296d6b57335027fc506b49d5c278f6a8ce1049"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qnHufX28CVDC1Bq60ADyxjw/XjdH6IP7wbVuOKy8wOm7TFnYBI3OasvOqstHl+H5HVyCGLde5qJGlp605iOYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:53:13.293532Z","bundle_sha256":"6872ca7017580d83b32cf676fe8ec735068b0d6d2b224002ec6731deb1b8f56d"}}