{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6RGX7JQDGUNJHUNPPBT7IU5YN5","short_pith_number":"pith:6RGX7JQD","canonical_record":{"source":{"id":"1510.07880","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2015-10-27T11:51:41Z","cross_cats_sorted":[],"title_canon_sha256":"b621f3e731d53a5df69a36d8b46d56033239723d404abbe74a7cfd5cdb9b34bd","abstract_canon_sha256":"8d51d7394799c453a94fb31eca6c7ea839a569242745dc7aab8ca54ec8df0c73"},"schema_version":"1.0"},"canonical_sha256":"f44d7fa603351a93d1af7867f453b86f6c4457840d4cfcb54d2bd60c8cf2705c","source":{"kind":"arxiv","id":"1510.07880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07880","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07880v1","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07880","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"6RGX7JQDGUNJ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6RGX7JQDGUNJHUNP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6RGX7JQD","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6RGX7JQDGUNJHUNPPBT7IU5YN5","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07880","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2015-10-27T11:51:41Z","cross_cats_sorted":[],"title_canon_sha256":"b621f3e731d53a5df69a36d8b46d56033239723d404abbe74a7cfd5cdb9b34bd","abstract_canon_sha256":"8d51d7394799c453a94fb31eca6c7ea839a569242745dc7aab8ca54ec8df0c73"},"schema_version":"1.0"},"canonical_sha256":"f44d7fa603351a93d1af7867f453b86f6c4457840d4cfcb54d2bd60c8cf2705c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:45.093048Z","signature_b64":"7lblTfp5ms3uEi/IVMv2AUmkfKHeRbzCWIYRbcrZV/no9padPuLNOzlLRNggHL72jhR891d+lmLgNAPpuOrnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f44d7fa603351a93d1af7867f453b86f6c4457840d4cfcb54d2bd60c8cf2705c","last_reissued_at":"2026-05-18T01:28:45.092500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:45.092500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07880","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-18T01:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98kAwblWP8j8jfKJp6er7PaaUTf840ugsKQshCw6H4Setssupcb4mJ87el2EwIkHfyWODTYoRDUzsyuv4jupAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:27:09.620056Z"},"content_sha256":"9b9154f6b7e6c626ea3daeb16f45cd887f5c9a4cbacafcb0ab77539c809b3cc7","schema_version":"1.0","event_id":"sha256:9b9154f6b7e6c626ea3daeb16f45cd887f5c9a4cbacafcb0ab77539c809b3cc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6RGX7JQDGUNJHUNPPBT7IU5YN5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rules in Play: On the Complexity of Routing Tables and Firewalls","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ambar Pal, Ayush Shah, H.B. Acharya, Mohit Wadhwa, Paritosh Mittal","submitted_at":"2015-10-27T11:51:41Z","abstract_excerpt":"A fundamental component of networking infras- tructure is the policy, used in routing tables and firewalls. Accordingly, there has been extensive study of policies. However, the theory of such policies indicates that the size of the decision tree for a policy is very large ( O((2n)d), where the policy has n rules and examines d features of packets). If this was indeed the case, the existing algorithms to detect anomalies, conflicts, and redundancies would not be tractable for practical policies (say, n = 1000 and d = 10). In this paper, we clear up this apparent paradox. Using the concept of '"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07880","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-18T01:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjzHVz8/NkFKYJzd0+RFEcRVW7b+BiVcQsnGghoXwPKta43ZcR2pIxMC6onfSk2sJpqXQjZX0MXs8agNlohxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:27:09.620799Z"},"content_sha256":"a8582b7ad793dfaa37ede69ce3868809e0027d73801f19d0eec33e2c69fe776f","schema_version":"1.0","event_id":"sha256:a8582b7ad793dfaa37ede69ce3868809e0027d73801f19d0eec33e2c69fe776f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RGX7JQDGUNJHUNPPBT7IU5YN5/bundle.json","state_url":"https://pith.science/pith/6RGX7JQDGUNJHUNPPBT7IU5YN5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RGX7JQDGUNJHUNPPBT7IU5YN5/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-09T11:27:09Z","links":{"resolver":"https://pith.science/pith/6RGX7JQDGUNJHUNPPBT7IU5YN5","bundle":"https://pith.science/pith/6RGX7JQDGUNJHUNPPBT7IU5YN5/bundle.json","state":"https://pith.science/pith/6RGX7JQDGUNJHUNPPBT7IU5YN5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RGX7JQDGUNJHUNPPBT7IU5YN5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6RGX7JQDGUNJHUNPPBT7IU5YN5","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":"8d51d7394799c453a94fb31eca6c7ea839a569242745dc7aab8ca54ec8df0c73","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2015-10-27T11:51:41Z","title_canon_sha256":"b621f3e731d53a5df69a36d8b46d56033239723d404abbe74a7cfd5cdb9b34bd"},"schema_version":"1.0","source":{"id":"1510.07880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07880","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07880v1","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07880","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"6RGX7JQDGUNJ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6RGX7JQDGUNJHUNP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6RGX7JQD","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:a8582b7ad793dfaa37ede69ce3868809e0027d73801f19d0eec33e2c69fe776f","target":"graph","created_at":"2026-05-18T01:28:45Z","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":"A fundamental component of networking infras- tructure is the policy, used in routing tables and firewalls. Accordingly, there has been extensive study of policies. However, the theory of such policies indicates that the size of the decision tree for a policy is very large ( O((2n)d), where the policy has n rules and examines d features of packets). If this was indeed the case, the existing algorithms to detect anomalies, conflicts, and redundancies would not be tractable for practical policies (say, n = 1000 and d = 10). In this paper, we clear up this apparent paradox. Using the concept of '","authors_text":"Ambar Pal, Ayush Shah, H.B. Acharya, Mohit Wadhwa, Paritosh Mittal","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2015-10-27T11:51:41Z","title":"Rules in Play: On the Complexity of Routing Tables and Firewalls"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07880","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:9b9154f6b7e6c626ea3daeb16f45cd887f5c9a4cbacafcb0ab77539c809b3cc7","target":"record","created_at":"2026-05-18T01:28:45Z","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":"8d51d7394799c453a94fb31eca6c7ea839a569242745dc7aab8ca54ec8df0c73","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2015-10-27T11:51:41Z","title_canon_sha256":"b621f3e731d53a5df69a36d8b46d56033239723d404abbe74a7cfd5cdb9b34bd"},"schema_version":"1.0","source":{"id":"1510.07880","kind":"arxiv","version":1}},"canonical_sha256":"f44d7fa603351a93d1af7867f453b86f6c4457840d4cfcb54d2bd60c8cf2705c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f44d7fa603351a93d1af7867f453b86f6c4457840d4cfcb54d2bd60c8cf2705c","first_computed_at":"2026-05-18T01:28:45.092500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:45.092500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7lblTfp5ms3uEi/IVMv2AUmkfKHeRbzCWIYRbcrZV/no9padPuLNOzlLRNggHL72jhR891d+lmLgNAPpuOrnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:45.093048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b9154f6b7e6c626ea3daeb16f45cd887f5c9a4cbacafcb0ab77539c809b3cc7","sha256:a8582b7ad793dfaa37ede69ce3868809e0027d73801f19d0eec33e2c69fe776f"],"state_sha256":"88f12464fa66a046333e243b6fbbd52157a66171c9539366fa120d310db4123c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Vcjh8YPGQBsOL47TE4sIIbiiMQWNSMM1KqiEcbiZnq6wIbIQzpcfWKNZmgzZh595eqG4jVZfHXoxf2HxHXZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:27:09.624786Z","bundle_sha256":"d31bd1e731ae255a169eab8e9b2b219b3fd37a66dfbdfdfaa43d4d5dea1174b9"}}