{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:T7UF77MJFG7V7TPX642FWQP2RY","short_pith_number":"pith:T7UF77MJ","canonical_record":{"source":{"id":"1402.1194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-05T21:45:26Z","cross_cats_sorted":[],"title_canon_sha256":"2ae573df68e053c27b310d691d7c59bb33574d8c33ecdff95ad57804b1773227","abstract_canon_sha256":"4c7902cca4039459b8b2aaa42ed094a1afa164121c74525a99d6ec8eb974992b"},"schema_version":"1.0"},"canonical_sha256":"9fe85ffd8929bf5fcdf7f7345b41fa8e09cec6565701126cdd6cb1ca8c47308c","source":{"kind":"arxiv","id":"1402.1194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1194","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1194v1","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1194","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"T7UF77MJFG7V","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T7UF77MJFG7V7TPX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T7UF77MJ","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:T7UF77MJFG7V7TPX642FWQP2RY","target":"record","payload":{"canonical_record":{"source":{"id":"1402.1194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-05T21:45:26Z","cross_cats_sorted":[],"title_canon_sha256":"2ae573df68e053c27b310d691d7c59bb33574d8c33ecdff95ad57804b1773227","abstract_canon_sha256":"4c7902cca4039459b8b2aaa42ed094a1afa164121c74525a99d6ec8eb974992b"},"schema_version":"1.0"},"canonical_sha256":"9fe85ffd8929bf5fcdf7f7345b41fa8e09cec6565701126cdd6cb1ca8c47308c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:59.945922Z","signature_b64":"NkwGRyFoJW4J3FPJBIq9r0I6NB4MiGob2kfkrPq3QoGOfIwyrzC0P2VWCNWAp+1cJ5UIxqMOGonbfUKtF8VTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fe85ffd8929bf5fcdf7f7345b41fa8e09cec6565701126cdd6cb1ca8c47308c","last_reissued_at":"2026-05-18T02:59:59.945098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:59.945098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.1194","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:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISevVEzgpGvQM4e7XqIf/KqOiNo0nwmtmGPabdsNSFkGX6GjjA5WOgd4dQBYAgQtcKhnCIqvxOsGMA3JXdR8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:09:43.869828Z"},"content_sha256":"ea3a1cdadccb5ae982a3ef55b636d6cebed3dbe625dd98b0b183a191d51edcdf","schema_version":"1.0","event_id":"sha256:ea3a1cdadccb5ae982a3ef55b636d6cebed3dbe625dd98b0b183a191d51edcdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:T7UF77MJFG7V7TPX642FWQP2RY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'as Majd\\'an, Attila K\\H{o}r\\\"osi, G\\'abor R\\'etv\\'ari, J\\'anos Tapolcai, Zal\\'an Heszberger","submitted_at":"2014-02-05T21:45:26Z","abstract_excerpt":"Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the efficiency of standard operations, like random access, search, or update. The main goal of this paper is to demonstrate how data compression can benefit the networking community, by showing how to squeeze the IP Forwarding Information Base (FIB), the giant table consulted by IP routers to make forwarding decisions, into information-theoretical entropy bounds, with essentially zero cost on longest prefix match and FIB u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1194","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:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiZzs28MtZTecr1EY3zlbOTA2F5IrprTaSnv51CZtxV4SU0YqhiOJlJn2M9zFVHIy7wWio6jocLpo2cpbEi+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:09:43.870826Z"},"content_sha256":"aace3296a96ab958788b799a67b36be3c2b0933bae69a1577c7170bfb959acfa","schema_version":"1.0","event_id":"sha256:aace3296a96ab958788b799a67b36be3c2b0933bae69a1577c7170bfb959acfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7UF77MJFG7V7TPX642FWQP2RY/bundle.json","state_url":"https://pith.science/pith/T7UF77MJFG7V7TPX642FWQP2RY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7UF77MJFG7V7TPX642FWQP2RY/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-26T17:09:43Z","links":{"resolver":"https://pith.science/pith/T7UF77MJFG7V7TPX642FWQP2RY","bundle":"https://pith.science/pith/T7UF77MJFG7V7TPX642FWQP2RY/bundle.json","state":"https://pith.science/pith/T7UF77MJFG7V7TPX642FWQP2RY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7UF77MJFG7V7TPX642FWQP2RY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:T7UF77MJFG7V7TPX642FWQP2RY","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":"4c7902cca4039459b8b2aaa42ed094a1afa164121c74525a99d6ec8eb974992b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-05T21:45:26Z","title_canon_sha256":"2ae573df68e053c27b310d691d7c59bb33574d8c33ecdff95ad57804b1773227"},"schema_version":"1.0","source":{"id":"1402.1194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1194","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1194v1","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1194","created_at":"2026-05-18T02:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"T7UF77MJFG7V","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T7UF77MJFG7V7TPX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T7UF77MJ","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:aace3296a96ab958788b799a67b36be3c2b0933bae69a1577c7170bfb959acfa","target":"graph","created_at":"2026-05-18T02:59:59Z","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":"Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the efficiency of standard operations, like random access, search, or update. The main goal of this paper is to demonstrate how data compression can benefit the networking community, by showing how to squeeze the IP Forwarding Information Base (FIB), the giant table consulted by IP routers to make forwarding decisions, into information-theoretical entropy bounds, with essentially zero cost on longest prefix match and FIB u","authors_text":"Andr\\'as Majd\\'an, Attila K\\H{o}r\\\"osi, G\\'abor R\\'etv\\'ari, J\\'anos Tapolcai, Zal\\'an Heszberger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-05T21:45:26Z","title":"Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1194","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:ea3a1cdadccb5ae982a3ef55b636d6cebed3dbe625dd98b0b183a191d51edcdf","target":"record","created_at":"2026-05-18T02:59:59Z","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":"4c7902cca4039459b8b2aaa42ed094a1afa164121c74525a99d6ec8eb974992b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-05T21:45:26Z","title_canon_sha256":"2ae573df68e053c27b310d691d7c59bb33574d8c33ecdff95ad57804b1773227"},"schema_version":"1.0","source":{"id":"1402.1194","kind":"arxiv","version":1}},"canonical_sha256":"9fe85ffd8929bf5fcdf7f7345b41fa8e09cec6565701126cdd6cb1ca8c47308c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fe85ffd8929bf5fcdf7f7345b41fa8e09cec6565701126cdd6cb1ca8c47308c","first_computed_at":"2026-05-18T02:59:59.945098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:59.945098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NkwGRyFoJW4J3FPJBIq9r0I6NB4MiGob2kfkrPq3QoGOfIwyrzC0P2VWCNWAp+1cJ5UIxqMOGonbfUKtF8VTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:59.945922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea3a1cdadccb5ae982a3ef55b636d6cebed3dbe625dd98b0b183a191d51edcdf","sha256:aace3296a96ab958788b799a67b36be3c2b0933bae69a1577c7170bfb959acfa"],"state_sha256":"3725cd4b717a6785158ac5c29b3cfe9231308dd375f00ebabb073aad63e7f547"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAnjx3hxUfBxhhPHj3QiVu4Y2D2Oc1AxjFhdmrmI3TBsGiGeAxCBEJ9p/j3ChQoOwGjJnWFqFarblkMqQikWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:09:43.874213Z","bundle_sha256":"c9d9c9be5c080e960abde81818c90b6eedc72f5826995e949a354625f4cd46d3"}}