{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7OZJT4KX2S5IJ63CXLYDUZNTVI","short_pith_number":"pith:7OZJT4KX","canonical_record":{"source":{"id":"1204.4323","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-19T11:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"1c0945f4d09a52936a04451f7a663ac87d3ded887e4ad56997c61803bea13c4b","abstract_canon_sha256":"4d6c3121ab3a4e92d64e368c02789b6fe9405453c9ce33f436792fbe3cb02600"},"schema_version":"1.0"},"canonical_sha256":"fbb299f157d4ba84fb62baf03a65b3aa169087d09db4d8404fe48b8fd38c04c3","source":{"kind":"arxiv","id":"1204.4323","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4323","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4323v3","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4323","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"7OZJT4KX2S5I","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7OZJT4KX2S5IJ63C","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7OZJT4KX","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7OZJT4KX2S5IJ63CXLYDUZNTVI","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4323","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-19T11:56:33Z","cross_cats_sorted":[],"title_canon_sha256":"1c0945f4d09a52936a04451f7a663ac87d3ded887e4ad56997c61803bea13c4b","abstract_canon_sha256":"4d6c3121ab3a4e92d64e368c02789b6fe9405453c9ce33f436792fbe3cb02600"},"schema_version":"1.0"},"canonical_sha256":"fbb299f157d4ba84fb62baf03a65b3aa169087d09db4d8404fe48b8fd38c04c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:16.140933Z","signature_b64":"SuobQCsn51bUNZhNqM5CduaZX5U6pi+lKxWmg4+3tNZykda/ZSJYIbOXfxS+om2wOG3qhJkz85jaOqETajEDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbb299f157d4ba84fb62baf03a65b3aa169087d09db4d8404fe48b8fd38c04c3","last_reissued_at":"2026-05-18T02:21:16.140472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:16.140472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4323","source_version":3,"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-18T02:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5x6090GbZdR0xmdoQd3pYrmHiqBnkOdZ8P9FjWg2DR2kzDpywyM7OqgGbgBUNMxaKK4aragH1DaDalQ8d2wDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:10:59.494741Z"},"content_sha256":"cd4040edd600198a4fb7ab60cda679b62f5e8f702cbdc48a1285c5749ad66a7b","schema_version":"1.0","event_id":"sha256:cd4040edd600198a4fb7ab60cda679b62f5e8f702cbdc48a1285c5749ad66a7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7OZJT4KX2S5IJ63CXLYDUZNTVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Capacity Relay Node Placement in a Multi-hop Wireless Network on a Line","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":"2012-04-19T11:56:33Z","abstract_excerpt":"We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a sink node. The achievable rate formulas that we use are for full-duplex radios at the relays and decode- and-forward relaying. For the single relay case, and individual power constraints at the source node and the relay node, we provide explicit formulas for the optimal relay location and the optimal power allocation to the source-relay channel, for the exponential and the power-law path-loss channel model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4323","kind":"arxiv","version":3},"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-18T02:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wbwngQhWoq6KaA7n916OwD5PKIAzy9x/UGMuDrWVqZvoxFkVfBzs6J1w62jWqZfRQxJSNSaYYOqGELrsKx4mCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:10:59.495420Z"},"content_sha256":"82391cfb9e51fefa0e5338f3a4235255194d9ab46807b377e637bb05dc23e996","schema_version":"1.0","event_id":"sha256:82391cfb9e51fefa0e5338f3a4235255194d9ab46807b377e637bb05dc23e996"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OZJT4KX2S5IJ63CXLYDUZNTVI/bundle.json","state_url":"https://pith.science/pith/7OZJT4KX2S5IJ63CXLYDUZNTVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OZJT4KX2S5IJ63CXLYDUZNTVI/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-06-08T21:10:59Z","links":{"resolver":"https://pith.science/pith/7OZJT4KX2S5IJ63CXLYDUZNTVI","bundle":"https://pith.science/pith/7OZJT4KX2S5IJ63CXLYDUZNTVI/bundle.json","state":"https://pith.science/pith/7OZJT4KX2S5IJ63CXLYDUZNTVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OZJT4KX2S5IJ63CXLYDUZNTVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7OZJT4KX2S5IJ63CXLYDUZNTVI","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":"4d6c3121ab3a4e92d64e368c02789b6fe9405453c9ce33f436792fbe3cb02600","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-19T11:56:33Z","title_canon_sha256":"1c0945f4d09a52936a04451f7a663ac87d3ded887e4ad56997c61803bea13c4b"},"schema_version":"1.0","source":{"id":"1204.4323","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4323","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4323v3","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4323","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"7OZJT4KX2S5I","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7OZJT4KX2S5IJ63C","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7OZJT4KX","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:82391cfb9e51fefa0e5338f3a4235255194d9ab46807b377e637bb05dc23e996","target":"graph","created_at":"2026-05-18T02:21:16Z","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":"We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a sink node. The achievable rate formulas that we use are for full-duplex radios at the relays and decode- and-forward relaying. For the single relay case, and individual power constraints at the source node and the relay node, we provide explicit formulas for the optimal relay location and the optimal power allocation to the source-relay channel, for the exponential and the power-law path-loss channel model","authors_text":"Abhishek Sinha, Anurag Kumar, Arpan Chattopadhyay, Marceau Coupechoux","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-19T11:56:33Z","title":"Optimal Capacity Relay Node Placement in a Multi-hop Wireless Network on a Line"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4323","kind":"arxiv","version":3},"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:cd4040edd600198a4fb7ab60cda679b62f5e8f702cbdc48a1285c5749ad66a7b","target":"record","created_at":"2026-05-18T02:21:16Z","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":"4d6c3121ab3a4e92d64e368c02789b6fe9405453c9ce33f436792fbe3cb02600","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-19T11:56:33Z","title_canon_sha256":"1c0945f4d09a52936a04451f7a663ac87d3ded887e4ad56997c61803bea13c4b"},"schema_version":"1.0","source":{"id":"1204.4323","kind":"arxiv","version":3}},"canonical_sha256":"fbb299f157d4ba84fb62baf03a65b3aa169087d09db4d8404fe48b8fd38c04c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbb299f157d4ba84fb62baf03a65b3aa169087d09db4d8404fe48b8fd38c04c3","first_computed_at":"2026-05-18T02:21:16.140472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:16.140472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SuobQCsn51bUNZhNqM5CduaZX5U6pi+lKxWmg4+3tNZykda/ZSJYIbOXfxS+om2wOG3qhJkz85jaOqETajEDCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:16.140933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4323","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd4040edd600198a4fb7ab60cda679b62f5e8f702cbdc48a1285c5749ad66a7b","sha256:82391cfb9e51fefa0e5338f3a4235255194d9ab46807b377e637bb05dc23e996"],"state_sha256":"7f5be7136a791b62fb9e75b708ef1eebee2949823557c8785c6962c765b246de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ruklXYdDTSpSImePuWA1X9wqAqiSdFOkigtfJ/9dAN3FZJYthIbF81msneB2LPRDz7HhWZCct/+njf5BGPeSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:10:59.499616Z","bundle_sha256":"6c51a4235af58abe3bb99c268756bd1c90419dbb236d65d49c2c4f770b3548c8"}}