{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AQCI4EJJBNUW4GHZAMOZHA6PPB","short_pith_number":"pith:AQCI4EJJ","canonical_record":{"source":{"id":"1203.6864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-30T17:16:41Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"9541ac185823b815696df8ff8084440e456569baed96745f268f7cb9c3f782fb","abstract_canon_sha256":"cf2d859ab6d028f0145d05114d2ba957c3676cdc07a306339098359bf6ecd5f0"},"schema_version":"1.0"},"canonical_sha256":"04048e11290b696e18f9031d9383cf785db33b5127087d5d514c98259aa13dd7","source":{"kind":"arxiv","id":"1203.6864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6864","created_at":"2026-05-18T03:58:52Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6864v1","created_at":"2026-05-18T03:58:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6864","created_at":"2026-05-18T03:58:52Z"},{"alias_kind":"pith_short_12","alias_value":"AQCI4EJJBNUW","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AQCI4EJJBNUW4GHZ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AQCI4EJJ","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AQCI4EJJBNUW4GHZAMOZHA6PPB","target":"record","payload":{"canonical_record":{"source":{"id":"1203.6864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-30T17:16:41Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"9541ac185823b815696df8ff8084440e456569baed96745f268f7cb9c3f782fb","abstract_canon_sha256":"cf2d859ab6d028f0145d05114d2ba957c3676cdc07a306339098359bf6ecd5f0"},"schema_version":"1.0"},"canonical_sha256":"04048e11290b696e18f9031d9383cf785db33b5127087d5d514c98259aa13dd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:52.080977Z","signature_b64":"MHxjscnPYJLiKLr/u4z8BnhW3LXU+oMjcFWpk096kC9ioQMwU6JgW7ZwAPIF+UzYs+7DCb2QN7BQgxLTGDxGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04048e11290b696e18f9031d9383cf785db33b5127087d5d514c98259aa13dd7","last_reissued_at":"2026-05-18T03:58:52.080195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:52.080195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.6864","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-18T03:58:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qg1p1Ev4//bar8EKfJRXdaKeTjsIh9ynLL/gQHSaU8xhokNyCxLR6zADAiBFwsJrll6CpLUMe+shbQHZYPJUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:34:14.770935Z"},"content_sha256":"237a165fd01e99999ade64a8b379a1e1bac4a688baacebc8a2dec1bb65d20259","schema_version":"1.0","event_id":"sha256:237a165fd01e99999ade64a8b379a1e1bac4a688baacebc8a2dec1bb65d20259"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AQCI4EJJBNUW4GHZAMOZHA6PPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory-Assisted Universal Compression of Network Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Faramarz Fekri, Mohsen Sardari","submitted_at":"2012-03-30T17:16:41Z","abstract_excerpt":"Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the network. These techniques are often based on either packet-level Redundancy Elimination (RE) or Content-Centric Networking (CCN). However, these techniques cannot exploit sub-packet redundancies. Further, other alternative techniques such as the end-to-end universal compression solutions would not perform well either over the Internet traffic, as such techniques require infinite length traffic to effectively remove redundancy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6864","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-18T03:58:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPXCbA/2H9Z2pX3HuiL5b3UV3k5Cvhv6XX3ZOtkR1D7+AOA0VFKhCGi4ugqhAzg4Qb9hs9idmNGqmNJpOfAkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:34:14.771582Z"},"content_sha256":"719d52c1212aff2af991133c26acc6decf7123041e5a2b07c43e14dd8147f501","schema_version":"1.0","event_id":"sha256:719d52c1212aff2af991133c26acc6decf7123041e5a2b07c43e14dd8147f501"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQCI4EJJBNUW4GHZAMOZHA6PPB/bundle.json","state_url":"https://pith.science/pith/AQCI4EJJBNUW4GHZAMOZHA6PPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQCI4EJJBNUW4GHZAMOZHA6PPB/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-07T18:34:14Z","links":{"resolver":"https://pith.science/pith/AQCI4EJJBNUW4GHZAMOZHA6PPB","bundle":"https://pith.science/pith/AQCI4EJJBNUW4GHZAMOZHA6PPB/bundle.json","state":"https://pith.science/pith/AQCI4EJJBNUW4GHZAMOZHA6PPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQCI4EJJBNUW4GHZAMOZHA6PPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AQCI4EJJBNUW4GHZAMOZHA6PPB","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":"cf2d859ab6d028f0145d05114d2ba957c3676cdc07a306339098359bf6ecd5f0","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-30T17:16:41Z","title_canon_sha256":"9541ac185823b815696df8ff8084440e456569baed96745f268f7cb9c3f782fb"},"schema_version":"1.0","source":{"id":"1203.6864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6864","created_at":"2026-05-18T03:58:52Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6864v1","created_at":"2026-05-18T03:58:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6864","created_at":"2026-05-18T03:58:52Z"},{"alias_kind":"pith_short_12","alias_value":"AQCI4EJJBNUW","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AQCI4EJJBNUW4GHZ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AQCI4EJJ","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:719d52c1212aff2af991133c26acc6decf7123041e5a2b07c43e14dd8147f501","target":"graph","created_at":"2026-05-18T03:58:52Z","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":"Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the network. These techniques are often based on either packet-level Redundancy Elimination (RE) or Content-Centric Networking (CCN). However, these techniques cannot exploit sub-packet redundancies. Further, other alternative techniques such as the end-to-end universal compression solutions would not perform well either over the Internet traffic, as such techniques require infinite length traffic to effectively remove redundancy","authors_text":"Ahmad Beirami, Faramarz Fekri, Mohsen Sardari","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-30T17:16:41Z","title":"Memory-Assisted Universal Compression of Network Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6864","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:237a165fd01e99999ade64a8b379a1e1bac4a688baacebc8a2dec1bb65d20259","target":"record","created_at":"2026-05-18T03:58:52Z","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":"cf2d859ab6d028f0145d05114d2ba957c3676cdc07a306339098359bf6ecd5f0","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-30T17:16:41Z","title_canon_sha256":"9541ac185823b815696df8ff8084440e456569baed96745f268f7cb9c3f782fb"},"schema_version":"1.0","source":{"id":"1203.6864","kind":"arxiv","version":1}},"canonical_sha256":"04048e11290b696e18f9031d9383cf785db33b5127087d5d514c98259aa13dd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04048e11290b696e18f9031d9383cf785db33b5127087d5d514c98259aa13dd7","first_computed_at":"2026-05-18T03:58:52.080195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:52.080195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MHxjscnPYJLiKLr/u4z8BnhW3LXU+oMjcFWpk096kC9ioQMwU6JgW7ZwAPIF+UzYs+7DCb2QN7BQgxLTGDxGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:52.080977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.6864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:237a165fd01e99999ade64a8b379a1e1bac4a688baacebc8a2dec1bb65d20259","sha256:719d52c1212aff2af991133c26acc6decf7123041e5a2b07c43e14dd8147f501"],"state_sha256":"418dd7524f477d86bd025b82e16bdee8b33af984d3e0b996ccd6949d7cc3d8ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2mXoEDiNNP6+6tvqZAEM16PErNrPdPHcjWy1vU6d8xKFkIlTNhUvAvRoDL9yKPuGMF2JjwlWhjMNCJyVJPGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:34:14.775092Z","bundle_sha256":"face8b2ef78561b4d77bdc20c91e9d49d663b38aec5f602cbcd780f04d06a77d"}}