{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D3G7ZXUWKPPOIXAYHXK2A7PH3I","short_pith_number":"pith:D3G7ZXUW","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"},"canonical_sha256":"1ecdfcde9653dee45c183dd5a07de7da23435383c0accb723108bcdeea2525e2","source":{"kind":"arxiv","id":"1711.01620","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01620","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01620v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01620","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"D3G7ZXUWKPPO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D3G7ZXUWKPPOIXAY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D3G7ZXUW","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D3G7ZXUWKPPOIXAYHXK2A7PH3I","target":"record","payload":{"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"},"canonical_sha256":"1ecdfcde9653dee45c183dd5a07de7da23435383c0accb723108bcdeea2525e2","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"},"source_kind":"arxiv","source_id":"1711.01620","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:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J07k4NrEQ3S7a1DPnPN50CyVGDBpY91YAzpo6soqz75wvroUuqlSI7t2loNFviJtO/40yRs0k9S2N/E5MWDEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:14:24.851806Z"},"content_sha256":"84379b57adc53d43d9223f173825f565dcf9837e4f9261de5d11d4cb2a414725","schema_version":"1.0","event_id":"sha256:84379b57adc53d43d9223f173825f565dcf9837e4f9261de5d11d4cb2a414725"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D3G7ZXUWKPPOIXAYHXK2A7PH3I","target":"graph","payload":{"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"},"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:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OzAHTB3mJ55bjxqPk0pXdzNjZWMCfC2gLXBUr9SHzUH5QgmrfCYn0GzAzGdBdZAS1fAFzrIZHmUAC5Y/tHzLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:14:24.852161Z"},"content_sha256":"6f42ceb9b79122cef2c5b8c774c13ce61e9dfcd29c2bfbb9945b1a184b599823","schema_version":"1.0","event_id":"sha256:6f42ceb9b79122cef2c5b8c774c13ce61e9dfcd29c2bfbb9945b1a184b599823"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/bundle.json","state_url":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/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-25T04:14:24Z","links":{"resolver":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I","bundle":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/bundle.json","state":"https://pith.science/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3G7ZXUWKPPOIXAYHXK2A7PH3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D3G7ZXUWKPPOIXAYHXK2A7PH3I","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":"1662826e266a63f3fa8e682ba0286c6e2ebb31d2d75d59e7b7d7f0f78b7f337b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-05T17:28:42Z","title_canon_sha256":"2e62aee2f71b045b7e7ef0778abf1eb309fc4d998230cf402edf70e2ac9da23d"},"schema_version":"1.0","source":{"id":"1711.01620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01620","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01620v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01620","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"D3G7ZXUWKPPO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D3G7ZXUWKPPOIXAY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D3G7ZXUW","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:6f42ceb9b79122cef2c5b8c774c13ce61e9dfcd29c2bfbb9945b1a184b599823","target":"graph","created_at":"2026-05-18T00:31:17Z","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. 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","authors_text":"Alper Kose, Muriel Medard","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-05T17:28:42Z","title":"Scheduling Wireless Ad Hoc Networks in Polynomial Time Using Claw-free Conflict Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01620","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:84379b57adc53d43d9223f173825f565dcf9837e4f9261de5d11d4cb2a414725","target":"record","created_at":"2026-05-18T00:31:17Z","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":"1662826e266a63f3fa8e682ba0286c6e2ebb31d2d75d59e7b7d7f0f78b7f337b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-05T17:28:42Z","title_canon_sha256":"2e62aee2f71b045b7e7ef0778abf1eb309fc4d998230cf402edf70e2ac9da23d"},"schema_version":"1.0","source":{"id":"1711.01620","kind":"arxiv","version":1}},"canonical_sha256":"1ecdfcde9653dee45c183dd5a07de7da23435383c0accb723108bcdeea2525e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ecdfcde9653dee45c183dd5a07de7da23435383c0accb723108bcdeea2525e2","first_computed_at":"2026-05-18T00:31:17.291716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:17.291716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ACIPJpjjnQ5nXHy+wtztms6ANKtvOpOL+DcbBD83y2XLQ0IXzJ0+GFEM7Ou/1iub2Bcios0gzcxh17XlQqfOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:17.292220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84379b57adc53d43d9223f173825f565dcf9837e4f9261de5d11d4cb2a414725","sha256:6f42ceb9b79122cef2c5b8c774c13ce61e9dfcd29c2bfbb9945b1a184b599823"],"state_sha256":"ab71d268beb29aafca79e4bc7f2c1df3458d97261a7c5494de0514c20b1ef5a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPnQQJhtkv87uzCSx6LA8hHk6vOo/ekSPGWo5armPc95AUvXOMwOK42jRZ0Pid1SVQaeSA5uLI8Kxc84ZSBcDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:14:24.854701Z","bundle_sha256":"81ef728eab4ab35328b7b8bee66f918889aed48ac26a906a9ae30482150a5d94"}}