{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WIJEN7LU6PGJR4CKLR2WUNXEVT","short_pith_number":"pith:WIJEN7LU","canonical_record":{"source":{"id":"1005.0855","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-05T21:13:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f69962eda900362bc2204078f13d84275ff1134c55f1f06eb2efbc18b09ee22c","abstract_canon_sha256":"03ef5dc53ee13708ec45d7264af376bd167e476d128f7afe2250384b15f08b5c"},"schema_version":"1.0"},"canonical_sha256":"b21246fd74f3cc98f04a5c756a36e4ace3cee71606a22da5f9d8e29c7e0047bc","source":{"kind":"arxiv","id":"1005.0855","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0855","created_at":"2026-07-04T17:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0855v2","created_at":"2026-07-04T17:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0855","created_at":"2026-07-04T17:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"WIJEN7LU6PGJ","created_at":"2026-07-04T17:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WIJEN7LU6PGJR4CK","created_at":"2026-07-04T17:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WIJEN7LU","created_at":"2026-07-04T17:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WIJEN7LU6PGJR4CKLR2WUNXEVT","target":"record","payload":{"canonical_record":{"source":{"id":"1005.0855","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-05T21:13:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f69962eda900362bc2204078f13d84275ff1134c55f1f06eb2efbc18b09ee22c","abstract_canon_sha256":"03ef5dc53ee13708ec45d7264af376bd167e476d128f7afe2250384b15f08b5c"},"schema_version":"1.0"},"canonical_sha256":"b21246fd74f3cc98f04a5c756a36e4ace3cee71606a22da5f9d8e29c7e0047bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:28:04.580312Z","signature_b64":"oThT5++druSz4X6MTMorcvOFz/QsClkJ6XAWLBIG8+QHOuAa8I4/SpW4ya2Sad8rVW6hmwdE+WNmxoySViIDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b21246fd74f3cc98f04a5c756a36e4ace3cee71606a22da5f9d8e29c7e0047bc","last_reissued_at":"2026-07-04T17:28:04.579831Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:28:04.579831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.0855","source_version":2,"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-07-04T17:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rC/9M4gsm0RS0auoo8EBN0TDCcUuU4LtAYH2lWctO1kYQSXw0+GNyVl7apo1rLdRG7DdYC3wo5PZu5P6gV//Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:05:31.051549Z"},"content_sha256":"944db3462c6fb81c2b21483b5ac7073ddcd4d0e5701294894c0bd9549a2743b8","schema_version":"1.0","event_id":"sha256:944db3462c6fb81c2b21483b5ac7073ddcd4d0e5701294894c0bd9549a2743b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WIJEN7LU6PGJR4CKLR2WUNXEVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Capacity Scaling of Underwater Networks: An Information-Theoretic Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel E. Lucani, Milica Stojanovic, Muriel Medard, Vahid Tarokh, Won-Yong Shin","submitted_at":"2010-05-05T21:13:10Z","abstract_excerpt":"Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of $n$. In the network, we characterize an attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is then derived in extended networks. Our result indicates that the upper bound is inversely proportional to the attenuation parameter, thus resulting in a highly power-limited network. Interestingly, it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0855","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1005.0855/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T17:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwXoZM6079IzNF1wz+XCnAbMKSzIZmBUFNEDq2aoXbPz3JdBCIaJG6I9b36zQn9PAYfcobocy/ZBKXSR3tSCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:05:31.051897Z"},"content_sha256":"19733b8714e26f3f3fab0e3a6e5107831a615bba736c39c0e44437a56a5522be","schema_version":"1.0","event_id":"sha256:19733b8714e26f3f3fab0e3a6e5107831a615bba736c39c0e44437a56a5522be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIJEN7LU6PGJR4CKLR2WUNXEVT/bundle.json","state_url":"https://pith.science/pith/WIJEN7LU6PGJR4CKLR2WUNXEVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIJEN7LU6PGJR4CKLR2WUNXEVT/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-08-06T03:05:31Z","links":{"resolver":"https://pith.science/pith/WIJEN7LU6PGJR4CKLR2WUNXEVT","bundle":"https://pith.science/pith/WIJEN7LU6PGJR4CKLR2WUNXEVT/bundle.json","state":"https://pith.science/pith/WIJEN7LU6PGJR4CKLR2WUNXEVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIJEN7LU6PGJR4CKLR2WUNXEVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WIJEN7LU6PGJR4CKLR2WUNXEVT","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":"03ef5dc53ee13708ec45d7264af376bd167e476d128f7afe2250384b15f08b5c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-05T21:13:10Z","title_canon_sha256":"f69962eda900362bc2204078f13d84275ff1134c55f1f06eb2efbc18b09ee22c"},"schema_version":"1.0","source":{"id":"1005.0855","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0855","created_at":"2026-07-04T17:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0855v2","created_at":"2026-07-04T17:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0855","created_at":"2026-07-04T17:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"WIJEN7LU6PGJ","created_at":"2026-07-04T17:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WIJEN7LU6PGJR4CK","created_at":"2026-07-04T17:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WIJEN7LU","created_at":"2026-07-04T17:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:19733b8714e26f3f3fab0e3a6e5107831a615bba736c39c0e44437a56a5522be","target":"graph","created_at":"2026-07-04T17:28:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1005.0855/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of $n$. In the network, we characterize an attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is then derived in extended networks. Our result indicates that the upper bound is inversely proportional to the attenuation parameter, thus resulting in a highly power-limited network. Interestingly, it","authors_text":"Daniel E. Lucani, Milica Stojanovic, Muriel Medard, Vahid Tarokh, Won-Yong Shin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-05T21:13:10Z","title":"On Capacity Scaling of Underwater Networks: An Information-Theoretic Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0855","kind":"arxiv","version":2},"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:944db3462c6fb81c2b21483b5ac7073ddcd4d0e5701294894c0bd9549a2743b8","target":"record","created_at":"2026-07-04T17:28:04Z","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":"03ef5dc53ee13708ec45d7264af376bd167e476d128f7afe2250384b15f08b5c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-05T21:13:10Z","title_canon_sha256":"f69962eda900362bc2204078f13d84275ff1134c55f1f06eb2efbc18b09ee22c"},"schema_version":"1.0","source":{"id":"1005.0855","kind":"arxiv","version":2}},"canonical_sha256":"b21246fd74f3cc98f04a5c756a36e4ace3cee71606a22da5f9d8e29c7e0047bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b21246fd74f3cc98f04a5c756a36e4ace3cee71606a22da5f9d8e29c7e0047bc","first_computed_at":"2026-07-04T17:28:04.579831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:28:04.579831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oThT5++druSz4X6MTMorcvOFz/QsClkJ6XAWLBIG8+QHOuAa8I4/SpW4ya2Sad8rVW6hmwdE+WNmxoySViIDCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T17:28:04.580312Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.0855","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:944db3462c6fb81c2b21483b5ac7073ddcd4d0e5701294894c0bd9549a2743b8","sha256:19733b8714e26f3f3fab0e3a6e5107831a615bba736c39c0e44437a56a5522be"],"state_sha256":"d9ca6c76bf98803af373014dc740a5b8a19faffc00c7686b22a36189c1848456"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPSDeJiwijanR8pabYM4ujWfAIfinmgFt3GVElh5ZAOQiCdk3U8DqEBYxVCrJkrKZYNCmdJNZYINkXe93XdcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T03:05:31.055296Z","bundle_sha256":"e9cd040d57fe99c420f5c690cf9d0f048708d14d9c6c305efe5959ad1c83a5e2"}}