{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RZR7RW7V7NMSAOQUZOUO6OLYO6","short_pith_number":"pith:RZR7RW7V","canonical_record":{"source":{"id":"1210.1185","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-10-03T18:09:11Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"079a1dbf800de37d69b60bbe09b45d0a250e92d9597cc070dd198fc308aeab34","abstract_canon_sha256":"a2e3a97fa4eb0d8ae31fa7d578560ba9ecbfb2028971377e9da27ba9f90a0e27"},"schema_version":"1.0"},"canonical_sha256":"8e63f8dbf5fb59203a14cba8ef3978778cd47169269269ad45085e17866cd587","source":{"kind":"arxiv","id":"1210.1185","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1185","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1185v3","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1185","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"RZR7RW7V7NMS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RZR7RW7V7NMSAOQU","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RZR7RW7V","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RZR7RW7V7NMSAOQUZOUO6OLYO6","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1185","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-10-03T18:09:11Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"079a1dbf800de37d69b60bbe09b45d0a250e92d9597cc070dd198fc308aeab34","abstract_canon_sha256":"a2e3a97fa4eb0d8ae31fa7d578560ba9ecbfb2028971377e9da27ba9f90a0e27"},"schema_version":"1.0"},"canonical_sha256":"8e63f8dbf5fb59203a14cba8ef3978778cd47169269269ad45085e17866cd587","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:24.818237Z","signature_b64":"ASRuXwHJy1ZvDa8S1BZev0Uoff+o7LGA3caqYgdydk25SzOaE8hQN+SC0np858GMJue3RXAaZbQQ54akaCG1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e63f8dbf5fb59203a14cba8ef3978778cd47169269269ad45085e17866cd587","last_reissued_at":"2026-05-18T02:17:24.817515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:24.817515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1185","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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"loJDw18WSi8xW3FPJajM6Gqu6Rq/WnUJEx/sQ7GNy42HFmUSrM4tRkkDHgCZQvwF6+tAs8ZPkkUOKAFEoHnQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:24:27.691122Z"},"content_sha256":"97d024492bc402414271c5f08972ffb57a9351b57b4e11c4b937794a75781198","schema_version":"1.0","event_id":"sha256:97d024492bc402414271c5f08972ffb57a9351b57b4e11c4b937794a75781198"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RZR7RW7V7NMSAOQUZOUO6OLYO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Laws of the Throughput Capacity and Latency in Information-Centric Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Bita Azimdoost, Cedric Westphal, Hamid R. Sadjadpour","submitted_at":"2012-10-03T18:09:11Z","abstract_excerpt":"Wireless information-centric networks consider storage as one of the network primitives, and propose to cache data within the network in order to improve latency and reduce bandwidth consumption. We study the throughput capacity and delay in an information-centric network when the data cached in each node has a limited lifetime. The results show that with some fixed request and cache expiration rates, the order of the data access time does not change with network growth, and the maximum throughput order is inversely proportional to the square root and logarithm of the network size $n$ in cases"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1185","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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s6IJOuy3QpwN0EHZJMgvingYaTV6c61jrTTr7dFQdLQWlEMZ+0hyTWIy12tX7Wb3OUsn1W0UVPSJJxH/XT+0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:24:27.691778Z"},"content_sha256":"f2007ee5af0b0e3ec034e8f5069ccd2ecd636fca0788fc127c84e4ea56c1521f","schema_version":"1.0","event_id":"sha256:f2007ee5af0b0e3ec034e8f5069ccd2ecd636fca0788fc127c84e4ea56c1521f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZR7RW7V7NMSAOQUZOUO6OLYO6/bundle.json","state_url":"https://pith.science/pith/RZR7RW7V7NMSAOQUZOUO6OLYO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZR7RW7V7NMSAOQUZOUO6OLYO6/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-05-28T16:24:27Z","links":{"resolver":"https://pith.science/pith/RZR7RW7V7NMSAOQUZOUO6OLYO6","bundle":"https://pith.science/pith/RZR7RW7V7NMSAOQUZOUO6OLYO6/bundle.json","state":"https://pith.science/pith/RZR7RW7V7NMSAOQUZOUO6OLYO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZR7RW7V7NMSAOQUZOUO6OLYO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RZR7RW7V7NMSAOQUZOUO6OLYO6","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":"a2e3a97fa4eb0d8ae31fa7d578560ba9ecbfb2028971377e9da27ba9f90a0e27","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-10-03T18:09:11Z","title_canon_sha256":"079a1dbf800de37d69b60bbe09b45d0a250e92d9597cc070dd198fc308aeab34"},"schema_version":"1.0","source":{"id":"1210.1185","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1185","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1185v3","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1185","created_at":"2026-05-18T02:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"RZR7RW7V7NMS","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RZR7RW7V7NMSAOQU","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RZR7RW7V","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:f2007ee5af0b0e3ec034e8f5069ccd2ecd636fca0788fc127c84e4ea56c1521f","target":"graph","created_at":"2026-05-18T02:17:24Z","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":"Wireless information-centric networks consider storage as one of the network primitives, and propose to cache data within the network in order to improve latency and reduce bandwidth consumption. We study the throughput capacity and delay in an information-centric network when the data cached in each node has a limited lifetime. The results show that with some fixed request and cache expiration rates, the order of the data access time does not change with network growth, and the maximum throughput order is inversely proportional to the square root and logarithm of the network size $n$ in cases","authors_text":"Bita Azimdoost, Cedric Westphal, Hamid R. Sadjadpour","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-10-03T18:09:11Z","title":"Scaling Laws of the Throughput Capacity and Latency in Information-Centric Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1185","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:97d024492bc402414271c5f08972ffb57a9351b57b4e11c4b937794a75781198","target":"record","created_at":"2026-05-18T02:17:24Z","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":"a2e3a97fa4eb0d8ae31fa7d578560ba9ecbfb2028971377e9da27ba9f90a0e27","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-10-03T18:09:11Z","title_canon_sha256":"079a1dbf800de37d69b60bbe09b45d0a250e92d9597cc070dd198fc308aeab34"},"schema_version":"1.0","source":{"id":"1210.1185","kind":"arxiv","version":3}},"canonical_sha256":"8e63f8dbf5fb59203a14cba8ef3978778cd47169269269ad45085e17866cd587","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e63f8dbf5fb59203a14cba8ef3978778cd47169269269ad45085e17866cd587","first_computed_at":"2026-05-18T02:17:24.817515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:24.817515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ASRuXwHJy1ZvDa8S1BZev0Uoff+o7LGA3caqYgdydk25SzOaE8hQN+SC0np858GMJue3RXAaZbQQ54akaCG1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:24.818237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1185","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97d024492bc402414271c5f08972ffb57a9351b57b4e11c4b937794a75781198","sha256:f2007ee5af0b0e3ec034e8f5069ccd2ecd636fca0788fc127c84e4ea56c1521f"],"state_sha256":"2702de3c010d38e256cf9453f065cb9e7829281f06f964068db29dee70f38ee2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5tHhge1xCczYPGt0YYrm7C5LgtYL+05iOd3XAYTcBq7W9x2ZbSki0hOfzYDWF/neuqlt8ZHuqaH8QCanpo8aBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:24:27.694545Z","bundle_sha256":"211262c586e8318fe24d0d6171b2445eceb0c0199c59990c9b6052d7e287f860"}}