{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BDURYB7NJSJ2EGFCP5YT23AQLY","short_pith_number":"pith:BDURYB7N","schema_version":"1.0","canonical_sha256":"08e91c07ed4c93a218a27f713d6c105e368f96b763550ac3d6573bcfa490b977","source":{"kind":"arxiv","id":"1712.00658","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.00658","created_at":"2026-05-18T00:29:02.264262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00658v1","created_at":"2026-05-18T00:29:02.264262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00658","created_at":"2026-05-18T00:29:02.264262+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDURYB7NJSJ2","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDURYB7NJSJ2EGFC","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDURYB7N","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY","json":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY.json","graph_json":"https://pith.science/api/pith-number/BDURYB7NJSJ2EGFCP5YT23AQLY/graph.json","events_json":"https://pith.science/api/pith-number/BDURYB7NJSJ2EGFCP5YT23AQLY/events.json","paper":"https://pith.science/paper/BDURYB7N"},"agent_actions":{"view_html":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY","download_json":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY.json","view_paper":"https://pith.science/paper/BDURYB7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00658&json=true","fetch_graph":"https://pith.science/api/pith-number/BDURYB7NJSJ2EGFCP5YT23AQLY/graph.json","fetch_events":"https://pith.science/api/pith-number/BDURYB7NJSJ2EGFCP5YT23AQLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/action/storage_attestation","attest_author":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/action/author_attestation","sign_citation":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/action/citation_signature","submit_replication":"https://pith.science/pith/BDURYB7NJSJ2EGFCP5YT23AQLY/action/replication_record"}},"created_at":"2026-05-18T00:29:02.264262+00:00","updated_at":"2026-05-18T00:29:02.264262+00:00"}