{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IASN2DSGQ4SKTVEK3CNZVRTBPF","short_pith_number":"pith:IASN2DSG","canonical_record":{"source":{"id":"1305.0384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T10:08:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac43df97a9b76de2f2100387a94a730fbc4b69248ee9e3ec2127f6e04d40f4ca","abstract_canon_sha256":"a5fb590a9e91bd332b7cd60481599acbdd429696347fc1b637f6c9a0e3cc49b5"},"schema_version":"1.0"},"canonical_sha256":"4024dd0e468724a9d48ad89b9ac6617944d4df2550f462b43120a9738a33d5c4","source":{"kind":"arxiv","id":"1305.0384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0384","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0384v1","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0384","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"IASN2DSGQ4SK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IASN2DSGQ4SKTVEK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IASN2DSG","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IASN2DSGQ4SKTVEK3CNZVRTBPF","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T10:08:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac43df97a9b76de2f2100387a94a730fbc4b69248ee9e3ec2127f6e04d40f4ca","abstract_canon_sha256":"a5fb590a9e91bd332b7cd60481599acbdd429696347fc1b637f6c9a0e3cc49b5"},"schema_version":"1.0"},"canonical_sha256":"4024dd0e468724a9d48ad89b9ac6617944d4df2550f462b43120a9738a33d5c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:40.409657Z","signature_b64":"qvxxkiwvgWGA6u0/i7+satislTNFpbPmWb/A7Lu2K67M/QbTrEy+tZT7Qqf8tptFM0UBczjmxtPjLSPyJwA/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4024dd0e468724a9d48ad89b9ac6617944d4df2550f462b43120a9738a33d5c4","last_reissued_at":"2026-05-18T03:26:40.409163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:40.409163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0384","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kjx/Fu/h6qVhjoMcmClylJrstFm78beaPFhHBSM+pj8I7BrnlQZjgHn33+mcrv2HfPQCZBJLAcS6Ksj/PtlKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:17:46.561106Z"},"content_sha256":"02936e82d388f43d2f4c8ea8f9921453f4a05bc3f85fa94d92778b15e319888a","schema_version":"1.0","event_id":"sha256:02936e82d388f43d2f4c8ea8f9921453f4a05bc3f85fa94d92778b15e319888a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IASN2DSGQ4SKTVEK3CNZVRTBPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Distributed Scheduling in Wireless Networks under the SINR interference model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Proutiere, Prasanna Chaporkar","submitted_at":"2013-05-02T10:08:30Z","abstract_excerpt":"Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper \\cite{tassiulas1}, Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its throughput-optimality. Since then, there have been extensive research efforts to devise distributed implementations of this algorithm. Recently, distributed adaptive CSMA scheduling schemes \\cite{jiang08} have been proposed and shown to be optimal, without the need of message passing among transmitters. However their analysis relies on the assumption that interference "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0384","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7+T++BrIV/U0q3Y5I+apuDbNWBdcqDIMFNucNkavbdrrz1L7+tl7JbCfVpYcG9O1tUldVVw6HqGkdu02Bp1lAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:17:46.561500Z"},"content_sha256":"35fe4a83f312be32a2a442d2e685c8f6be619b6f89f7d356fa1abbab2083109b","schema_version":"1.0","event_id":"sha256:35fe4a83f312be32a2a442d2e685c8f6be619b6f89f7d356fa1abbab2083109b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/bundle.json","state_url":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/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-27T07:17:46Z","links":{"resolver":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF","bundle":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/bundle.json","state":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IASN2DSGQ4SKTVEK3CNZVRTBPF","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":"a5fb590a9e91bd332b7cd60481599acbdd429696347fc1b637f6c9a0e3cc49b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T10:08:30Z","title_canon_sha256":"ac43df97a9b76de2f2100387a94a730fbc4b69248ee9e3ec2127f6e04d40f4ca"},"schema_version":"1.0","source":{"id":"1305.0384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0384","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0384v1","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0384","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"IASN2DSGQ4SK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IASN2DSGQ4SKTVEK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IASN2DSG","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:35fe4a83f312be32a2a442d2e685c8f6be619b6f89f7d356fa1abbab2083109b","target":"graph","created_at":"2026-05-18T03:26:40Z","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":"Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper \\cite{tassiulas1}, Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its throughput-optimality. Since then, there have been extensive research efforts to devise distributed implementations of this algorithm. Recently, distributed adaptive CSMA scheduling schemes \\cite{jiang08} have been proposed and shown to be optimal, without the need of message passing among transmitters. However their analysis relies on the assumption that interference ","authors_text":"Alexandre Proutiere, Prasanna Chaporkar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T10:08:30Z","title":"Optimal Distributed Scheduling in Wireless Networks under the SINR interference model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0384","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:02936e82d388f43d2f4c8ea8f9921453f4a05bc3f85fa94d92778b15e319888a","target":"record","created_at":"2026-05-18T03:26:40Z","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":"a5fb590a9e91bd332b7cd60481599acbdd429696347fc1b637f6c9a0e3cc49b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T10:08:30Z","title_canon_sha256":"ac43df97a9b76de2f2100387a94a730fbc4b69248ee9e3ec2127f6e04d40f4ca"},"schema_version":"1.0","source":{"id":"1305.0384","kind":"arxiv","version":1}},"canonical_sha256":"4024dd0e468724a9d48ad89b9ac6617944d4df2550f462b43120a9738a33d5c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4024dd0e468724a9d48ad89b9ac6617944d4df2550f462b43120a9738a33d5c4","first_computed_at":"2026-05-18T03:26:40.409163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:40.409163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qvxxkiwvgWGA6u0/i7+satislTNFpbPmWb/A7Lu2K67M/QbTrEy+tZT7Qqf8tptFM0UBczjmxtPjLSPyJwA/CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:40.409657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02936e82d388f43d2f4c8ea8f9921453f4a05bc3f85fa94d92778b15e319888a","sha256:35fe4a83f312be32a2a442d2e685c8f6be619b6f89f7d356fa1abbab2083109b"],"state_sha256":"c5177d1e693ed0b62ed09e52808902c9a0dfd85b5c3e57e91f8327779fa33c11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnXM3Sf6Kjr3KDiFaM/GYzBFRnith/3+jVlft0GeIAaHoLKP0gv4rBzBOqaKvaUy1AYO00IYI1ktVwsk0FMWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:17:46.564057Z","bundle_sha256":"6e5b2bfa5b9c1cd13d0a5bf9825e94559456aebdfa9251c7d3ae3b7be5a6c444"}}