{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KNLMFTD2BCQ7R4UA4OQ4KYDCLB","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":"51b0de73c94694de17da3af504a6eb0b0e4aa673708b4f842e1f8385eace826f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-10T18:22:16Z","title_canon_sha256":"29afd31a76d455e9f2b665ae4fe1e2a0fce564899a5125d0548cdf3d091a7093"},"schema_version":"1.0","source":{"id":"1708.03347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03347","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03347v1","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03347","created_at":"2026-05-18T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"KNLMFTD2BCQ7","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNLMFTD2BCQ7R4UA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNLMFTD2","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:8b48809f0e5de8eb774e1ac4ebd4397fed36618ea2833c4d2aa7c031b91f9fc5","target":"graph","created_at":"2026-05-18T00:03:24Z","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":"Routing is a widespread approach to transfer information from a source node to a destination node in many deployed wireless ad-hoc networks. Today's implemented routing algorithms seek to efficiently find the path/route with the largest Full-Duplex (FD) capacity, which is given by the minimum among the point-to-point link capacities in the path. Such an approach may be suboptimal if then the nodes in the selected path are operated in Half-Duplex (HD) mode. Recently, the capacity (up to a constant gap that only depends on the number of nodes in the path) of an HD line network i.e., a path) has ","authors_text":"Christina Fragouli, Daniela Tuninetti, Martina Cardone, Yahya H. Ezzeldin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-10T18:22:16Z","title":"Half-Duplex Routing is NP-hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03347","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:536df70b945d12380ede690506166f74c3db3e0d91e5b0805dad89d56f2a176b","target":"record","created_at":"2026-05-18T00:03:24Z","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":"51b0de73c94694de17da3af504a6eb0b0e4aa673708b4f842e1f8385eace826f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-10T18:22:16Z","title_canon_sha256":"29afd31a76d455e9f2b665ae4fe1e2a0fce564899a5125d0548cdf3d091a7093"},"schema_version":"1.0","source":{"id":"1708.03347","kind":"arxiv","version":1}},"canonical_sha256":"5356c2cc7a08a1f8f280e3a1c560625846387a18dfdf4d6e00e28528551ec669","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5356c2cc7a08a1f8f280e3a1c560625846387a18dfdf4d6e00e28528551ec669","first_computed_at":"2026-05-18T00:03:24.983539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:24.983539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BWjPSzH2cDB+codffsUMZ7pDny8Lfvxz+4mX24uEHrXCzgwpo4bNjnRw4AR2WV0uZ2ZiAPaoBt3HBNH4IzbbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:24.983977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:536df70b945d12380ede690506166f74c3db3e0d91e5b0805dad89d56f2a176b","sha256:8b48809f0e5de8eb774e1ac4ebd4397fed36618ea2833c4d2aa7c031b91f9fc5"],"state_sha256":"d206c9ce7edbcd0c44e0e452d19b2de2990c5aadb0d1ab6e2c631ba76a60bfec"}