{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BDURYB7NJSJ2EGFCP5YT23AQLY","short_pith_number":"pith:BDURYB7N","canonical_record":{"source":{"id":"1712.00658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-02T19:30:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"94fe912512d441910f6ec7b1abce6f0d729f41f0d996ce444f680bc3d451e7c8","abstract_canon_sha256":"76168cf22c64209a04acc9281188fa5ee455a2d04ae72a01bb00488c726a928b"},"schema_version":"1.0"},"canonical_sha256":"08e91c07ed4c93a218a27f713d6c105e368f96b763550ac3d6573bcfa490b977","source":{"kind":"arxiv","id":"1712.00658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00658","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00658v1","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00658","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"BDURYB7NJSJ2","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BDURYB7NJSJ2EGFC","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BDURYB7N","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BDURYB7NJSJ2EGFCP5YT23AQLY","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-02T19:30:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"94fe912512d441910f6ec7b1abce6f0d729f41f0d996ce444f680bc3d451e7c8","abstract_canon_sha256":"76168cf22c64209a04acc9281188fa5ee455a2d04ae72a01bb00488c726a928b"},"schema_version":"1.0"},"canonical_sha256":"08e91c07ed4c93a218a27f713d6c105e368f96b763550ac3d6573bcfa490b977","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:02.264856Z","signature_b64":"LwjxpyeuQHXyKzWfyhXL3haDME9eYTXdaKTYIAU97jNNrNBOt4RfSD+n5YeQtEonj7VvtwYtlIfjAaSYk8q7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08e91c07ed4c93a218a27f713d6c105e368f96b763550ac3d6573bcfa490b977","last_reissued_at":"2026-05-18T00:29:02.264161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:02.264161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00658","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-18T00:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7Csta5ePk1MFnyhlTum4tWY4wvpbcJ7aHov++XFuK27Q/4In4NoeZ73lqMlmyjIaDswlScfgwGMaGTuSJyhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:19:26.981197Z"},"content_sha256":"10262080b7f6f99100701815182aa9c19d48b203a29fd27617998198f2df4a0a","schema_version":"1.0","event_id":"sha256:10262080b7f6f99100701815182aa9c19d48b203a29fd27617998198f2df4a0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BDURYB7NJSJ2EGFCP5YT23AQLY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alper Kose, Hakan Gokcesu, Kaan Gokcesu, Muriel Medard, Noyan Evirgen","submitted_at":"2017-12-02T19:30:51Z","abstract_excerpt":"In this paper, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when such scheduling problems can be represented by claw-free conflict graphs where we consider a wireless broadcast medium. It is possible to formulate a scheduling problem of network coded flows as finding maximum weighted independent set (MWIS) in the conflict graph of the network. Finding MWIS of a general graph is NP-hard leading to an NP-hard complexity of scheduling. In a claw-free conflict graph, MWIS can be found in polynomial time leading to a throughput-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00658","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-18T00:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaOPIjQxSUGH85GO1YFrazQJh0ckZxleoPvFic7Ghwt43Nltpsekvbup+8SHepELMXfNG5v3LUxuZjPR08ovBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:19:26.981594Z"},"content_sha256":"bfac649409d687cd04103e8093e85a4efa0c799804fae4049200e54540871252","schema_version":"1.0","event_id":"sha256:bfac649409d687cd04103e8093e85a4efa0c799804fae4049200e54540871252"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/bundle.json","state_url":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/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-25T02:19:26Z","links":{"resolver":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY","bundle":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/bundle.json","state":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BDURYB7NJSJ2EGFCP5YT23AQLY","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":"76168cf22c64209a04acc9281188fa5ee455a2d04ae72a01bb00488c726a928b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-02T19:30:51Z","title_canon_sha256":"94fe912512d441910f6ec7b1abce6f0d729f41f0d996ce444f680bc3d451e7c8"},"schema_version":"1.0","source":{"id":"1712.00658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00658","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00658v1","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00658","created_at":"2026-05-18T00:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"BDURYB7NJSJ2","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BDURYB7NJSJ2EGFC","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BDURYB7N","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:bfac649409d687cd04103e8093e85a4efa0c799804fae4049200e54540871252","target":"graph","created_at":"2026-05-18T00:29:02Z","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 the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when such scheduling problems can be represented by claw-free conflict graphs where we consider a wireless broadcast medium. It is possible to formulate a scheduling problem of network coded flows as finding maximum weighted independent set (MWIS) in the conflict graph of the network. Finding MWIS of a general graph is NP-hard leading to an NP-hard complexity of scheduling. In a claw-free conflict graph, MWIS can be found in polynomial time leading to a throughput-o","authors_text":"Alper Kose, Hakan Gokcesu, Kaan Gokcesu, Muriel Medard, Noyan Evirgen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-02T19:30:51Z","title":"Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00658","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:10262080b7f6f99100701815182aa9c19d48b203a29fd27617998198f2df4a0a","target":"record","created_at":"2026-05-18T00:29:02Z","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":"76168cf22c64209a04acc9281188fa5ee455a2d04ae72a01bb00488c726a928b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-02T19:30:51Z","title_canon_sha256":"94fe912512d441910f6ec7b1abce6f0d729f41f0d996ce444f680bc3d451e7c8"},"schema_version":"1.0","source":{"id":"1712.00658","kind":"arxiv","version":1}},"canonical_sha256":"08e91c07ed4c93a218a27f713d6c105e368f96b763550ac3d6573bcfa490b977","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08e91c07ed4c93a218a27f713d6c105e368f96b763550ac3d6573bcfa490b977","first_computed_at":"2026-05-18T00:29:02.264161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:02.264161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LwjxpyeuQHXyKzWfyhXL3haDME9eYTXdaKTYIAU97jNNrNBOt4RfSD+n5YeQtEonj7VvtwYtlIfjAaSYk8q7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:02.264856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10262080b7f6f99100701815182aa9c19d48b203a29fd27617998198f2df4a0a","sha256:bfac649409d687cd04103e8093e85a4efa0c799804fae4049200e54540871252"],"state_sha256":"700c87fcfdafff9d1b76d13130ec3f3b1dd85e15a7d5f47ac7441c707d0c541f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b8vlMtrkqhEBQZOdpbq6I3F/Uf+30M+qad/hlTs1+weEOygX4cB0svqVE/bOuIQV8i7JxE2wenwmNYYuerteAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T02:19:26.984216Z","bundle_sha256":"8f93e10f5cad6d900f0b2bbdc86718a3febeeb8c5aabfd1ba94fc92ffb5d0673"}}