{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D3G7ZXUWKPPOIXAYHXK2A7PH3I","short_pith_number":"pith:D3G7ZXUW","schema_version":"1.0","canonical_sha256":"1ecdfcde9653dee45c183dd5a07de7da23435383c0accb723108bcdeea2525e2","source":{"kind":"arxiv","id":"1711.01620","version":1},"attestation_state":"computed","paper":{"title":"Scheduling Wireless Ad Hoc Networks in Polynomial Time Using Claw-free Conflict Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alper Kose, Muriel Medard","submitted_at":"2017-11-05T17:28:42Z","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. 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. We consider activation of hyperedges in a hypergraph to model a wireless broadcast medium. We show that the conflict graph of certain wireless ad hoc networks are claw-free. It is known that finding MWIS of a general graph is NP-h"},"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":"1711.01620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-05T17:28:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2e62aee2f71b045b7e7ef0778abf1eb309fc4d998230cf402edf70e2ac9da23d","abstract_canon_sha256":"1662826e266a63f3fa8e682ba0286c6e2ebb31d2d75d59e7b7d7f0f78b7f337b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:17.292220Z","signature_b64":"ACIPJpjjnQ5nXHy+wtztms6ANKtvOpOL+DcbBD83y2XLQ0IXzJ0+GFEM7Ou/1iub2Bcios0gzcxh17XlQqfOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ecdfcde9653dee45c183dd5a07de7da23435383c0accb723108bcdeea2525e2","last_reissued_at":"2026-05-18T00:31:17.291716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:17.291716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling Wireless Ad Hoc Networks in Polynomial Time Using Claw-free Conflict Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alper Kose, Muriel Medard","submitted_at":"2017-11-05T17:28:42Z","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. 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. We consider activation of hyperedges in a hypergraph to model a wireless broadcast medium. We show that the conflict graph of certain wireless ad hoc networks are claw-free. It is known that finding MWIS of a general graph is NP-h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01620","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":"1711.01620","created_at":"2026-05-18T00:31:17.291795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01620v1","created_at":"2026-05-18T00:31:17.291795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01620","created_at":"2026-05-18T00:31:17.291795+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3G7ZXUWKPPO","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3G7ZXUWKPPOIXAY","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3G7ZXUW","created_at":"2026-05-18T12:31:10.602751+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/D3G7ZXUWKPPOIXAYHXK2A7PH3I","json":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I.json","graph_json":"https://pith.science/api/pith-number/D3G7ZXUWKPPOIXAYHXK2A7PH3I/graph.json","events_json":"https://pith.science/api/pith-number/D3G7ZXUWKPPOIXAYHXK2A7PH3I/events.json","paper":"https://pith.science/paper/D3G7ZXUW"},"agent_actions":{"view_html":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I","download_json":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I.json","view_paper":"https://pith.science/paper/D3G7ZXUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01620&json=true","fetch_graph":"https://pith.science/api/pith-number/D3G7ZXUWKPPOIXAYHXK2A7PH3I/graph.json","fetch_events":"https://pith.science/api/pith-number/D3G7ZXUWKPPOIXAYHXK2A7PH3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/action/storage_attestation","attest_author":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/action/author_attestation","sign_citation":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/action/citation_signature","submit_replication":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/action/replication_record"}},"created_at":"2026-05-18T00:31:17.291795+00:00","updated_at":"2026-05-18T00:31:17.291795+00:00"}