{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FGZBLC3W26TXIIDEO7J2OBBPYT","short_pith_number":"pith:FGZBLC3W","canonical_record":{"source":{"id":"1411.6359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-11-24T06:51:49Z","cross_cats_sorted":[],"title_canon_sha256":"d3e2c8c88d61ae506ee3d980f2f22428244feb6cfaad5523fe40b91116cc0c14","abstract_canon_sha256":"451af37803a2a7c101ac1ea001b67f14bd391d23efb150ed5443a1472bc0c892"},"schema_version":"1.0"},"canonical_sha256":"29b2158b76d7a774206477d3a7042fc4fbe2c1176a63d0cf3e11f8a486b66407","source":{"kind":"arxiv","id":"1411.6359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6359","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6359v1","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6359","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"FGZBLC3W26TX","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FGZBLC3W26TXIIDE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FGZBLC3W","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FGZBLC3W26TXIIDEO7J2OBBPYT","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-11-24T06:51:49Z","cross_cats_sorted":[],"title_canon_sha256":"d3e2c8c88d61ae506ee3d980f2f22428244feb6cfaad5523fe40b91116cc0c14","abstract_canon_sha256":"451af37803a2a7c101ac1ea001b67f14bd391d23efb150ed5443a1472bc0c892"},"schema_version":"1.0"},"canonical_sha256":"29b2158b76d7a774206477d3a7042fc4fbe2c1176a63d0cf3e11f8a486b66407","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:00.227051Z","signature_b64":"uZAMpg37r+6UjH+liiCBksOVKmN860ScloHnY8EJu7D9CYkfCQTm2aV3HmOX4OzwIKATDYY+zPKwuq0qWFjxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b2158b76d7a774206477d3a7042fc4fbe2c1176a63d0cf3e11f8a486b66407","last_reissued_at":"2026-05-18T02:33:00.226710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:00.226710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6359","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-18T02:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRIJysfHo5rd6keXRryn2WfvadYBU3GqhWQpYSYw7f+8AuTm5VphMoqd9HpbhLGz0OKRCfpDZ6ht1Yo7K4o3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:54:03.419197Z"},"content_sha256":"49b1b485dc07b2d8151c11944058a3d05dd7af492d8a3371c76c61710c4c1b86","schema_version":"1.0","event_id":"sha256:49b1b485dc07b2d8151c11944058a3d05dd7af492d8a3371c76c61710c4c1b86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FGZBLC3W26TXIIDEO7J2OBBPYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packet-Level Network Compression: Realization and Scaling of the Network-Wide Benefits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmad Beirami, Faramarz Fekri, Mohsen Sardari","submitted_at":"2014-11-24T06:51:49Z","abstract_excerpt":"The existence of considerable amount of redundancy in the Internet traffic at the packet level has stimulated the deployment of packet-level redundancy elimination techniques within the network by enabling network nodes to memorize data packets. Redundancy elimination results in traffic reduction which in turn improves the efficiency of network links. In this paper, the concept of network compression is introduced that aspires to exploit the statistical correlation beyond removing large duplicate strings from the flow to better suppress redundancy.\n  In the first part of the paper, we introduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6359","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-18T02:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z134OyDbUVs4kwk1Brf7VfhyiK05GLWtbTFSFS3JcfHke/CX80uJekOyjbT8xr4gJwhHhxZa7JwaKtT5XZ81BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:54:03.419549Z"},"content_sha256":"451fccf005e154e534fb1afd6382ab1eb1fe29491c6d30a6f527c2fe5d4b294b","schema_version":"1.0","event_id":"sha256:451fccf005e154e534fb1afd6382ab1eb1fe29491c6d30a6f527c2fe5d4b294b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGZBLC3W26TXIIDEO7J2OBBPYT/bundle.json","state_url":"https://pith.science/pith/FGZBLC3W26TXIIDEO7J2OBBPYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGZBLC3W26TXIIDEO7J2OBBPYT/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-23T16:54:03Z","links":{"resolver":"https://pith.science/pith/FGZBLC3W26TXIIDEO7J2OBBPYT","bundle":"https://pith.science/pith/FGZBLC3W26TXIIDEO7J2OBBPYT/bundle.json","state":"https://pith.science/pith/FGZBLC3W26TXIIDEO7J2OBBPYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGZBLC3W26TXIIDEO7J2OBBPYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FGZBLC3W26TXIIDEO7J2OBBPYT","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":"451af37803a2a7c101ac1ea001b67f14bd391d23efb150ed5443a1472bc0c892","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-11-24T06:51:49Z","title_canon_sha256":"d3e2c8c88d61ae506ee3d980f2f22428244feb6cfaad5523fe40b91116cc0c14"},"schema_version":"1.0","source":{"id":"1411.6359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6359","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6359v1","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6359","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"FGZBLC3W26TX","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FGZBLC3W26TXIIDE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FGZBLC3W","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:451fccf005e154e534fb1afd6382ab1eb1fe29491c6d30a6f527c2fe5d4b294b","target":"graph","created_at":"2026-05-18T02:33:00Z","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":"The existence of considerable amount of redundancy in the Internet traffic at the packet level has stimulated the deployment of packet-level redundancy elimination techniques within the network by enabling network nodes to memorize data packets. Redundancy elimination results in traffic reduction which in turn improves the efficiency of network links. In this paper, the concept of network compression is introduced that aspires to exploit the statistical correlation beyond removing large duplicate strings from the flow to better suppress redundancy.\n  In the first part of the paper, we introduc","authors_text":"Ahmad Beirami, Faramarz Fekri, Mohsen Sardari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-11-24T06:51:49Z","title":"Packet-Level Network Compression: Realization and Scaling of the Network-Wide Benefits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6359","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:49b1b485dc07b2d8151c11944058a3d05dd7af492d8a3371c76c61710c4c1b86","target":"record","created_at":"2026-05-18T02:33:00Z","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":"451af37803a2a7c101ac1ea001b67f14bd391d23efb150ed5443a1472bc0c892","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-11-24T06:51:49Z","title_canon_sha256":"d3e2c8c88d61ae506ee3d980f2f22428244feb6cfaad5523fe40b91116cc0c14"},"schema_version":"1.0","source":{"id":"1411.6359","kind":"arxiv","version":1}},"canonical_sha256":"29b2158b76d7a774206477d3a7042fc4fbe2c1176a63d0cf3e11f8a486b66407","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29b2158b76d7a774206477d3a7042fc4fbe2c1176a63d0cf3e11f8a486b66407","first_computed_at":"2026-05-18T02:33:00.226710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:00.226710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uZAMpg37r+6UjH+liiCBksOVKmN860ScloHnY8EJu7D9CYkfCQTm2aV3HmOX4OzwIKATDYY+zPKwuq0qWFjxAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:00.227051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49b1b485dc07b2d8151c11944058a3d05dd7af492d8a3371c76c61710c4c1b86","sha256:451fccf005e154e534fb1afd6382ab1eb1fe29491c6d30a6f527c2fe5d4b294b"],"state_sha256":"5019e4a7c8c88b53b7ffa79b7beeabf6b298eb40e376460ea2f27f541b5187f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q03ZssBlQDgE11nyplO5XjTWI9qtKE23Dvr/z9G63f5nyrRMtKL3BGcSlCBMvvU2zIdLRFjg/IJ1u1DwXZQ8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:54:03.421414Z","bundle_sha256":"cda658d6f096095835182cb6f56212a244b210a558d7e1e09532bbc788ffba44"}}