{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ENFFSGSC5VHTK7N4KM36RLGA2P","short_pith_number":"pith:ENFFSGSC","schema_version":"1.0","canonical_sha256":"234a591a42ed4f357dbc5337e8acc0d3df3a951af8833d07facec2b9ad3bef93","source":{"kind":"arxiv","id":"1709.03390","version":1},"attestation_state":"computed","paper":{"title":"Deploy-As-You-Go Wireless Relay Placement: An Optimal Sequential Decision Approach using the Multi-Relay Channel Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhishek Sinha, Anurag Kumar, Arpan Chattopadhyay, Marceau Coupechoux","submitted_at":"2017-09-07T20:03:50Z","abstract_excerpt":"We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of as-you-go deployment of relay nodes. The achievable rate formulas are for full-duplex radios at the relays and for decode-and-forward relaying. Deployment is done along the straight line joining a source node and a sink node at an unknown distance from the source. The problem is for a deployment agent to walk from the source to the sink, deploying relays as he walks, given that the distance to the sink is exponentially distributed with known mean. As a precursor, we apply the multi-relay c"},"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":"1709.03390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-09-07T20:03:50Z","cross_cats_sorted":[],"title_canon_sha256":"91274e9951683826d97eecec7a789b3ea43de322280136b39a4d676c547e8a17","abstract_canon_sha256":"b22ecb204aa8c15947b864dd2c6a85fe8daa4e74ff00d5e05ed60ec99c28c8e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:38.570256Z","signature_b64":"WQKcqfri4RPhUqhy6bCFnxmo76Vce1353Q/hpa/ejyqIzfFfk8lL6lHPTne6VlZd3zHlV05Fu0MdJ5wXtO/1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"234a591a42ed4f357dbc5337e8acc0d3df3a951af8833d07facec2b9ad3bef93","last_reissued_at":"2026-05-18T00:35:38.569741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:38.569741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deploy-As-You-Go Wireless Relay Placement: An Optimal Sequential Decision Approach using the Multi-Relay Channel Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhishek Sinha, Anurag Kumar, Arpan Chattopadhyay, Marceau Coupechoux","submitted_at":"2017-09-07T20:03:50Z","abstract_excerpt":"We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of as-you-go deployment of relay nodes. The achievable rate formulas are for full-duplex radios at the relays and for decode-and-forward relaying. Deployment is done along the straight line joining a source node and a sink node at an unknown distance from the source. The problem is for a deployment agent to walk from the source to the sink, deploying relays as he walks, given that the distance to the sink is exponentially distributed with known mean. As a precursor, we apply the multi-relay c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03390","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":"1709.03390","created_at":"2026-05-18T00:35:38.569829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03390v1","created_at":"2026-05-18T00:35:38.569829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03390","created_at":"2026-05-18T00:35:38.569829+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENFFSGSC5VHT","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENFFSGSC5VHTK7N4","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENFFSGSC","created_at":"2026-05-18T12:31:12.930513+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/ENFFSGSC5VHTK7N4KM36RLGA2P","json":"https://pith.science/pith/ENFFSGSC5VHTK7N4KM36RLGA2P.json","graph_json":"https://pith.science/api/pith-number/ENFFSGSC5VHTK7N4KM36RLGA2P/graph.json","events_json":"https://pith.science/api/pith-number/ENFFSGSC5VHTK7N4KM36RLGA2P/events.json","paper":"https://pith.science/paper/ENFFSGSC"},"agent_actions":{"view_html":"https://pith.science/pith/ENFFSGSC5VHTK7N4KM36RLGA2P","download_json":"https://pith.science/pith/ENFFSGSC5VHTK7N4KM36RLGA2P.json","view_paper":"https://pith.science/paper/ENFFSGSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03390&json=true","fetch_graph":"https://pith.science/api/pith-number/ENFFSGSC5VHTK7N4KM36RLGA2P/graph.json","fetch_events":"https://pith.science/api/pith-number/ENFFSGSC5VHTK7N4KM36RLGA2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENFFSGSC5VHTK7N4KM36RLGA2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENFFSGSC5VHTK7N4KM36RLGA2P/action/storage_attestation","attest_author":"https://pith.science/pith/ENFFSGSC5VHTK7N4KM36RLGA2P/action/author_attestation","sign_citation":"https://pith.science/pith/ENFFSGSC5VHTK7N4KM36RLGA2P/action/citation_signature","submit_replication":"https://pith.science/pith/ENFFSGSC5VHTK7N4KM36RLGA2P/action/replication_record"}},"created_at":"2026-05-18T00:35:38.569829+00:00","updated_at":"2026-05-18T00:35:38.569829+00:00"}