{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PU7SNBFZE4OKDXZFVIEEVHDJ5U","short_pith_number":"pith:PU7SNBFZ","schema_version":"1.0","canonical_sha256":"7d3f2684b9271ca1df25aa084a9c69ed3755990a130f343bbb80864bc0b3c9c4","source":{"kind":"arxiv","id":"1605.03282","version":1},"attestation_state":"computed","paper":{"title":"Capacity of Three-Dimensional Erasure Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Cheol Jeong, Won-Yong Shin","submitted_at":"2016-05-11T05:01:41Z","abstract_excerpt":"In this paper, we introduce a large-scale three-dimensional (3D) erasure network, where $n$ wireless nodes are randomly distributed in a cuboid of $n^{\\lambda}\\times n^{\\mu}\\times n^{\\nu}$ with $\\lambda+\\mu+\\nu=1$ for $\\lambda,\\mu,\\nu>0$, and completely characterize its capacity scaling laws. Two fundamental path-loss attenuation models (i.e., exponential and polynomial power-law models) are used to suitably model an erasure probability for packet transmission. Then, under the two erasure models, we introduce a routing protocol using percolation highway in 3D space, and then analyze its achiev"},"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":"1605.03282","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-11T05:01:41Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"426c268ca15306a031180f9908b651b7c6b98a2690052c85a0fd8b945db57bfa","abstract_canon_sha256":"50ef06c08a0171e2e1be7ba79d685c113bd87c221aaa82bf9abe8eacc5552d87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:05.806789Z","signature_b64":"xOgNMuuoZb/HRFqyy4xkkqvJqfB9ajGmnKoTe7+1tcGvmO7CIDoNm/plXV3AKHOxu9y/mQ5ju4jRb5ZLOWxKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d3f2684b9271ca1df25aa084a9c69ed3755990a130f343bbb80864bc0b3c9c4","last_reissued_at":"2026-05-18T01:15:05.806326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:05.806326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of Three-Dimensional Erasure Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Cheol Jeong, Won-Yong Shin","submitted_at":"2016-05-11T05:01:41Z","abstract_excerpt":"In this paper, we introduce a large-scale three-dimensional (3D) erasure network, where $n$ wireless nodes are randomly distributed in a cuboid of $n^{\\lambda}\\times n^{\\mu}\\times n^{\\nu}$ with $\\lambda+\\mu+\\nu=1$ for $\\lambda,\\mu,\\nu>0$, and completely characterize its capacity scaling laws. Two fundamental path-loss attenuation models (i.e., exponential and polynomial power-law models) are used to suitably model an erasure probability for packet transmission. Then, under the two erasure models, we introduce a routing protocol using percolation highway in 3D space, and then analyze its achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03282","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":"1605.03282","created_at":"2026-05-18T01:15:05.806397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03282v1","created_at":"2026-05-18T01:15:05.806397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03282","created_at":"2026-05-18T01:15:05.806397+00:00"},{"alias_kind":"pith_short_12","alias_value":"PU7SNBFZE4OK","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PU7SNBFZE4OKDXZF","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PU7SNBFZ","created_at":"2026-05-18T12:30:39.010887+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/PU7SNBFZE4OKDXZFVIEEVHDJ5U","json":"https://pith.science/pith/PU7SNBFZE4OKDXZFVIEEVHDJ5U.json","graph_json":"https://pith.science/api/pith-number/PU7SNBFZE4OKDXZFVIEEVHDJ5U/graph.json","events_json":"https://pith.science/api/pith-number/PU7SNBFZE4OKDXZFVIEEVHDJ5U/events.json","paper":"https://pith.science/paper/PU7SNBFZ"},"agent_actions":{"view_html":"https://pith.science/pith/PU7SNBFZE4OKDXZFVIEEVHDJ5U","download_json":"https://pith.science/pith/PU7SNBFZE4OKDXZFVIEEVHDJ5U.json","view_paper":"https://pith.science/paper/PU7SNBFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03282&json=true","fetch_graph":"https://pith.science/api/pith-number/PU7SNBFZE4OKDXZFVIEEVHDJ5U/graph.json","fetch_events":"https://pith.science/api/pith-number/PU7SNBFZE4OKDXZFVIEEVHDJ5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PU7SNBFZE4OKDXZFVIEEVHDJ5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PU7SNBFZE4OKDXZFVIEEVHDJ5U/action/storage_attestation","attest_author":"https://pith.science/pith/PU7SNBFZE4OKDXZFVIEEVHDJ5U/action/author_attestation","sign_citation":"https://pith.science/pith/PU7SNBFZE4OKDXZFVIEEVHDJ5U/action/citation_signature","submit_replication":"https://pith.science/pith/PU7SNBFZE4OKDXZFVIEEVHDJ5U/action/replication_record"}},"created_at":"2026-05-18T01:15:05.806397+00:00","updated_at":"2026-05-18T01:15:05.806397+00:00"}