{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AF4EP3VYLBGWEQNNCP5XUDQ7CU","short_pith_number":"pith:AF4EP3VY","schema_version":"1.0","canonical_sha256":"017847eeb8584d6241ad13fb7a0e1f153ada45b6a1e297d1b2f8ced2478fc2eb","source":{"kind":"arxiv","id":"1305.3688","version":2},"attestation_state":"computed","paper":{"title":"The Thinnest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Ananthram Swami, Jianhang Gao, Qing Zhao","submitted_at":"2013-05-16T06:17:51Z","abstract_excerpt":"We formulate and study the thinnest path problem in wireless ad hoc networks. The objective is to find a path from a source to its destination that results in the minimum number of nodes overhearing the message by a judicious choice of relaying nodes and their corresponding transmission power. We adopt a directed hypergraph model of the problem and establish the NP-completeness of the problem in 2-D networks. We then develop two polynomial-time approximation algorithms that offer $\\sqrt{\\frac{n}{2}}$ and $\\frac{n}{2\\sqrt{n-1}}$ approximation ratios for general directed hypergraphs (which can m"},"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":"1305.3688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-16T06:17:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"71bb65906c38ccee776ba52314650ce33b53a4f26ff15c96403f97f0a98b8f44","abstract_canon_sha256":"6b1c641722323391b580a6fd30fee52ffc8831ce978ec7a45263938f1e870cb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:38.275541Z","signature_b64":"XMlpVfKEWjVtJQ6i1ZvaDFsMAX2BPUShEdKtT4HC00oyG7YjGnwBME+RzKsVndXmzryxkE0AdwIPc0DpXSPICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"017847eeb8584d6241ad13fb7a0e1f153ada45b6a1e297d1b2f8ced2478fc2eb","last_reissued_at":"2026-05-18T03:16:38.275069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:38.275069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Thinnest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Ananthram Swami, Jianhang Gao, Qing Zhao","submitted_at":"2013-05-16T06:17:51Z","abstract_excerpt":"We formulate and study the thinnest path problem in wireless ad hoc networks. The objective is to find a path from a source to its destination that results in the minimum number of nodes overhearing the message by a judicious choice of relaying nodes and their corresponding transmission power. We adopt a directed hypergraph model of the problem and establish the NP-completeness of the problem in 2-D networks. We then develop two polynomial-time approximation algorithms that offer $\\sqrt{\\frac{n}{2}}$ and $\\frac{n}{2\\sqrt{n-1}}$ approximation ratios for general directed hypergraphs (which can m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3688","kind":"arxiv","version":2},"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":"1305.3688","created_at":"2026-05-18T03:16:38.275144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3688v2","created_at":"2026-05-18T03:16:38.275144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3688","created_at":"2026-05-18T03:16:38.275144+00:00"},{"alias_kind":"pith_short_12","alias_value":"AF4EP3VYLBGW","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AF4EP3VYLBGWEQNN","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AF4EP3VY","created_at":"2026-05-18T12:27:38.830355+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/AF4EP3VYLBGWEQNNCP5XUDQ7CU","json":"https://pith.science/pith/AF4EP3VYLBGWEQNNCP5XUDQ7CU.json","graph_json":"https://pith.science/api/pith-number/AF4EP3VYLBGWEQNNCP5XUDQ7CU/graph.json","events_json":"https://pith.science/api/pith-number/AF4EP3VYLBGWEQNNCP5XUDQ7CU/events.json","paper":"https://pith.science/paper/AF4EP3VY"},"agent_actions":{"view_html":"https://pith.science/pith/AF4EP3VYLBGWEQNNCP5XUDQ7CU","download_json":"https://pith.science/pith/AF4EP3VYLBGWEQNNCP5XUDQ7CU.json","view_paper":"https://pith.science/paper/AF4EP3VY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3688&json=true","fetch_graph":"https://pith.science/api/pith-number/AF4EP3VYLBGWEQNNCP5XUDQ7CU/graph.json","fetch_events":"https://pith.science/api/pith-number/AF4EP3VYLBGWEQNNCP5XUDQ7CU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AF4EP3VYLBGWEQNNCP5XUDQ7CU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AF4EP3VYLBGWEQNNCP5XUDQ7CU/action/storage_attestation","attest_author":"https://pith.science/pith/AF4EP3VYLBGWEQNNCP5XUDQ7CU/action/author_attestation","sign_citation":"https://pith.science/pith/AF4EP3VYLBGWEQNNCP5XUDQ7CU/action/citation_signature","submit_replication":"https://pith.science/pith/AF4EP3VYLBGWEQNNCP5XUDQ7CU/action/replication_record"}},"created_at":"2026-05-18T03:16:38.275144+00:00","updated_at":"2026-05-18T03:16:38.275144+00:00"}