{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:6YH4MNIZECRXCYLV3Q4A23VMQL","short_pith_number":"pith:6YH4MNIZ","schema_version":"1.0","canonical_sha256":"f60fc6351920a3716175dc380d6eac82c0a2377cbbb672d54dee6b506fe3f10f","source":{"kind":"arxiv","id":"0802.2360","version":1},"attestation_state":"computed","paper":{"title":"On Maximizing Coverage in Gaussian Relay Networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Bennatan, A. Robert Calderbank, Vaneet Aggarwal","submitted_at":"2008-02-17T04:38:22Z","abstract_excerpt":"Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The new objective captures the problem of how to deploy relays to provide a given level of service to a particular geographic area, where the relay locations become a design parameter that can be optimized. We evaluate the decode and forward (DF) and compress and forward (CF) strategies for the relay channel with respect to the new objective of maximizi"},"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":"0802.2360","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2008-02-17T04:38:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c20e13fa95ec1b8b85e5dc12a3b98f3c9e61c8d8b0501c52d685b89295eb1b1","abstract_canon_sha256":"813608486b4a57a47667db497b6f94dba22d7222c2b42caae5c42525284381cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:44.423008Z","signature_b64":"W4QL+538HiqJ+/uRGpyHxqjldf/tr//65Xy+nY42QFba4NjxL27XrSPT96oyAQ4kaQi8EjFHBzv1qOQJWMsNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60fc6351920a3716175dc380d6eac82c0a2377cbbb672d54dee6b506fe3f10f","last_reissued_at":"2026-05-18T00:38:44.422391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:44.422391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Maximizing Coverage in Gaussian Relay Networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Bennatan, A. Robert Calderbank, Vaneet Aggarwal","submitted_at":"2008-02-17T04:38:22Z","abstract_excerpt":"Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The new objective captures the problem of how to deploy relays to provide a given level of service to a particular geographic area, where the relay locations become a design parameter that can be optimized. We evaluate the decode and forward (DF) and compress and forward (CF) strategies for the relay channel with respect to the new objective of maximizi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.2360","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":"0802.2360","created_at":"2026-05-18T00:38:44.422487+00:00"},{"alias_kind":"arxiv_version","alias_value":"0802.2360v1","created_at":"2026-05-18T00:38:44.422487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.2360","created_at":"2026-05-18T00:38:44.422487+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YH4MNIZECRX","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YH4MNIZECRXCYLV","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YH4MNIZ","created_at":"2026-05-18T12:25:56.245647+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/6YH4MNIZECRXCYLV3Q4A23VMQL","json":"https://pith.science/pith/6YH4MNIZECRXCYLV3Q4A23VMQL.json","graph_json":"https://pith.science/api/pith-number/6YH4MNIZECRXCYLV3Q4A23VMQL/graph.json","events_json":"https://pith.science/api/pith-number/6YH4MNIZECRXCYLV3Q4A23VMQL/events.json","paper":"https://pith.science/paper/6YH4MNIZ"},"agent_actions":{"view_html":"https://pith.science/pith/6YH4MNIZECRXCYLV3Q4A23VMQL","download_json":"https://pith.science/pith/6YH4MNIZECRXCYLV3Q4A23VMQL.json","view_paper":"https://pith.science/paper/6YH4MNIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0802.2360&json=true","fetch_graph":"https://pith.science/api/pith-number/6YH4MNIZECRXCYLV3Q4A23VMQL/graph.json","fetch_events":"https://pith.science/api/pith-number/6YH4MNIZECRXCYLV3Q4A23VMQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YH4MNIZECRXCYLV3Q4A23VMQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YH4MNIZECRXCYLV3Q4A23VMQL/action/storage_attestation","attest_author":"https://pith.science/pith/6YH4MNIZECRXCYLV3Q4A23VMQL/action/author_attestation","sign_citation":"https://pith.science/pith/6YH4MNIZECRXCYLV3Q4A23VMQL/action/citation_signature","submit_replication":"https://pith.science/pith/6YH4MNIZECRXCYLV3Q4A23VMQL/action/replication_record"}},"created_at":"2026-05-18T00:38:44.422487+00:00","updated_at":"2026-05-18T00:38:44.422487+00:00"}