{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Y4NUAN4EMF4E4PPRW47YJTYR3Q","short_pith_number":"pith:Y4NUAN4E","canonical_record":{"source":{"id":"1108.4152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-21T01:01:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c666b064bb5f23b660a6725da01bb0e9fb9a0d2ae8882486681a9f092ae8ed9d","abstract_canon_sha256":"85864e0e02bf07b11ae098f93df42dbd004f0a3489ca2c59dd60f396fbf57f51"},"schema_version":"1.0"},"canonical_sha256":"c71b40378461784e3df1b73f84cf11dc1657df077b0fecdfbc44c7c31948f6e2","source":{"kind":"arxiv","id":"1108.4152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4152","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4152v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4152","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"Y4NUAN4EMF4E","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y4NUAN4EMF4E4PPR","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y4NUAN4E","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Y4NUAN4EMF4E4PPRW47YJTYR3Q","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-21T01:01:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c666b064bb5f23b660a6725da01bb0e9fb9a0d2ae8882486681a9f092ae8ed9d","abstract_canon_sha256":"85864e0e02bf07b11ae098f93df42dbd004f0a3489ca2c59dd60f396fbf57f51"},"schema_version":"1.0"},"canonical_sha256":"c71b40378461784e3df1b73f84cf11dc1657df077b0fecdfbc44c7c31948f6e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.266684Z","signature_b64":"DzQdSer9am4bJs5CEMotpR1j1hsxoOTnMWfvgwaUElXezq0NI7u+nz0m6F1AgeepsItDnSIZEOBTEg6F0S/fDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c71b40378461784e3df1b73f84cf11dc1657df077b0fecdfbc44c7c31948f6e2","last_reissued_at":"2026-05-18T00:57:57.266022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.266022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4152","source_version":1,"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-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CeZFrQ4oganZrDPJz9mtxrJdkR+5F8A+gnc7vmjo/OGWozOSaW3ZW/MHG6GjpRuNH7x5qp7cJfy+fNxFNSP1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:13:02.282047Z"},"content_sha256":"90b8d62bbc1aac76c8c942aec2a8f670656ecac1aaafd97c9f2a7319db8e12f5","schema_version":"1.0","event_id":"sha256:90b8d62bbc1aac76c8c942aec2a8f670656ecac1aaafd97c9f2a7319db8e12f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Y4NUAN4EMF4E4PPRW47YJTYR3Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Network-Wide Gain of Memory-Assisted Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Faramarz Fekri, Mohsen Sardari","submitted_at":"2011-08-21T01:01:42Z","abstract_excerpt":"Several studies have identified a significant amount of redundancy in the network traffic. For example, it is demonstrated that there is a great amount of redundancy within the content of a server over time. This redundancy can be leveraged to reduce the network flow by the deployment of memory units in the network. The question that arises is whether or not the deployment of memory can result in a fundamental improvement in the performance of the network. In this paper, we answer this question affirmatively by first establishing the fundamental gains of memory-assisted source compression and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4152","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"},"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-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehTWLUsd5D3RgboanfeJUZO1zH6mHL6vyiroSCPwwzwYizlrl1pXVbLZKTemi7pW1o8hbdwUcJLoMuW4vCuHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:13:02.282676Z"},"content_sha256":"ea57fe652411d82cc94f467e8f19c5d6ffc9949f34aad11a856778d033f908fa","schema_version":"1.0","event_id":"sha256:ea57fe652411d82cc94f467e8f19c5d6ffc9949f34aad11a856778d033f908fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4NUAN4EMF4E4PPRW47YJTYR3Q/bundle.json","state_url":"https://pith.science/pith/Y4NUAN4EMF4E4PPRW47YJTYR3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4NUAN4EMF4E4PPRW47YJTYR3Q/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-07T06:13:02Z","links":{"resolver":"https://pith.science/pith/Y4NUAN4EMF4E4PPRW47YJTYR3Q","bundle":"https://pith.science/pith/Y4NUAN4EMF4E4PPRW47YJTYR3Q/bundle.json","state":"https://pith.science/pith/Y4NUAN4EMF4E4PPRW47YJTYR3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4NUAN4EMF4E4PPRW47YJTYR3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Y4NUAN4EMF4E4PPRW47YJTYR3Q","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":"85864e0e02bf07b11ae098f93df42dbd004f0a3489ca2c59dd60f396fbf57f51","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-21T01:01:42Z","title_canon_sha256":"c666b064bb5f23b660a6725da01bb0e9fb9a0d2ae8882486681a9f092ae8ed9d"},"schema_version":"1.0","source":{"id":"1108.4152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4152","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4152v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4152","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"Y4NUAN4EMF4E","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Y4NUAN4EMF4E4PPR","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Y4NUAN4E","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:ea57fe652411d82cc94f467e8f19c5d6ffc9949f34aad11a856778d033f908fa","target":"graph","created_at":"2026-05-18T00:57:57Z","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":"Several studies have identified a significant amount of redundancy in the network traffic. For example, it is demonstrated that there is a great amount of redundancy within the content of a server over time. This redundancy can be leveraged to reduce the network flow by the deployment of memory units in the network. The question that arises is whether or not the deployment of memory can result in a fundamental improvement in the performance of the network. In this paper, we answer this question affirmatively by first establishing the fundamental gains of memory-assisted source compression and ","authors_text":"Ahmad Beirami, Faramarz Fekri, Mohsen Sardari","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-21T01:01:42Z","title":"On the Network-Wide Gain of Memory-Assisted Source Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4152","kind":"arxiv","version":1},"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:90b8d62bbc1aac76c8c942aec2a8f670656ecac1aaafd97c9f2a7319db8e12f5","target":"record","created_at":"2026-05-18T00:57:57Z","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":"85864e0e02bf07b11ae098f93df42dbd004f0a3489ca2c59dd60f396fbf57f51","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-21T01:01:42Z","title_canon_sha256":"c666b064bb5f23b660a6725da01bb0e9fb9a0d2ae8882486681a9f092ae8ed9d"},"schema_version":"1.0","source":{"id":"1108.4152","kind":"arxiv","version":1}},"canonical_sha256":"c71b40378461784e3df1b73f84cf11dc1657df077b0fecdfbc44c7c31948f6e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c71b40378461784e3df1b73f84cf11dc1657df077b0fecdfbc44c7c31948f6e2","first_computed_at":"2026-05-18T00:57:57.266022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.266022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DzQdSer9am4bJs5CEMotpR1j1hsxoOTnMWfvgwaUElXezq0NI7u+nz0m6F1AgeepsItDnSIZEOBTEg6F0S/fDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.266684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90b8d62bbc1aac76c8c942aec2a8f670656ecac1aaafd97c9f2a7319db8e12f5","sha256:ea57fe652411d82cc94f467e8f19c5d6ffc9949f34aad11a856778d033f908fa"],"state_sha256":"3f026976381dc53191d5fa75d5d775142c94123805bb243110e004a98cd93832"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dy6gXBjX6itZMnh8dxMn2dY7g1QAWfplYzDpj+wUA+3xErIG00ZwMj9X80XWZ+Arghv9AFz+rV9yBTpsJ8VtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:13:02.286133Z","bundle_sha256":"c3e2fdfa61d544bf47849341d77da666c4da93bb7e4ef398244c3855ee123885"}}