{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RHC6BZP6HOJISOK3OT27537357","short_pith_number":"pith:RHC6BZP6","canonical_record":{"source":{"id":"1107.5372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-27T03:01:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"11ca6f26d3052000ed633ee978aaff6169592de97ff8c264beac8f627cbf518d","abstract_canon_sha256":"fc61d82fd5805c23225f84eb8148796457f9b9df55f22d73aaf2558234a9da08"},"schema_version":"1.0"},"canonical_sha256":"89c5e0e5fe3b9289395b74f5feeffbefc614f69bda9ac1d67517450277a31fcd","source":{"kind":"arxiv","id":"1107.5372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5372","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5372v1","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5372","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"RHC6BZP6HOJI","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RHC6BZP6HOJISOK3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RHC6BZP6","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RHC6BZP6HOJISOK3OT27537357","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-27T03:01:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"11ca6f26d3052000ed633ee978aaff6169592de97ff8c264beac8f627cbf518d","abstract_canon_sha256":"fc61d82fd5805c23225f84eb8148796457f9b9df55f22d73aaf2558234a9da08"},"schema_version":"1.0"},"canonical_sha256":"89c5e0e5fe3b9289395b74f5feeffbefc614f69bda9ac1d67517450277a31fcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:52.178651Z","signature_b64":"RsbmranhjhCQjO/Hdor8JPXS2+CFZwcYpH6mxiMB2R9K5EXzmnQ9z0SuPtIrWAWfFpXPIm8vreW1Aal7ZOnoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89c5e0e5fe3b9289395b74f5feeffbefc614f69bda9ac1d67517450277a31fcd","last_reissued_at":"2026-05-18T04:16:52.177926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:52.177926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5372","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-18T04:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjiuteVyrZRooGIbHcvO5hi9XIBsAqOxmZtIzqDLq19dzPNpsoZ3t98idM9PXn/wFsjUbnP98E/1FvhrcWZdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:13:06.514799Z"},"content_sha256":"c53d913ffaee96ad09e9b8a73153c4235cf68a4bc1b1fd9c9e22f0088c0f5cf2","schema_version":"1.0","event_id":"sha256:c53d913ffaee96ad09e9b8a73153c4235cf68a4bc1b1fd9c9e22f0088c0f5cf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RHC6BZP6HOJISOK3OT27537357","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bidirectional Pipelining for Scalable IP Lookup and Packet Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Hoang Le, Viktor K. Prasanna, Weirong Jiang","submitted_at":"2011-07-27T03:01:36Z","abstract_excerpt":"Both IP lookup and packet classification in IP routers can be implemented by some form of tree traversal. SRAM-based Pipelining can improve the throughput dramatically. However, previous pipelining schemes result in unbalanced memory allocation over the pipeline stages. This has been identified as a major challenge for scalable pipelined solutions. This paper proposes a flexible bidirectional linear pipeline architecture based on widely-used dual-port SRAMs. A search tree is partitioned, and then mapped onto pipeline stages by a bidirectional fine-grained mapping scheme. We introduce the notio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5372","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-18T04:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mayREjG40cW0hYmN1QgBOxSdAaFv7Vi9DIWUTzZH3Sknad6f7ZtpX9DhrNFZu7wFm7s+asXv3RllkJPQqq+UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:13:06.515153Z"},"content_sha256":"f5dd1b90dccef039a09d2224cf4f5c44ca4d0f8c69eb662e3c49e64835969f66","schema_version":"1.0","event_id":"sha256:f5dd1b90dccef039a09d2224cf4f5c44ca4d0f8c69eb662e3c49e64835969f66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RHC6BZP6HOJISOK3OT27537357/bundle.json","state_url":"https://pith.science/pith/RHC6BZP6HOJISOK3OT27537357/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RHC6BZP6HOJISOK3OT27537357/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-31T03:13:06Z","links":{"resolver":"https://pith.science/pith/RHC6BZP6HOJISOK3OT27537357","bundle":"https://pith.science/pith/RHC6BZP6HOJISOK3OT27537357/bundle.json","state":"https://pith.science/pith/RHC6BZP6HOJISOK3OT27537357/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RHC6BZP6HOJISOK3OT27537357/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RHC6BZP6HOJISOK3OT27537357","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":"fc61d82fd5805c23225f84eb8148796457f9b9df55f22d73aaf2558234a9da08","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-27T03:01:36Z","title_canon_sha256":"11ca6f26d3052000ed633ee978aaff6169592de97ff8c264beac8f627cbf518d"},"schema_version":"1.0","source":{"id":"1107.5372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5372","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5372v1","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5372","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"RHC6BZP6HOJI","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RHC6BZP6HOJISOK3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RHC6BZP6","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:f5dd1b90dccef039a09d2224cf4f5c44ca4d0f8c69eb662e3c49e64835969f66","target":"graph","created_at":"2026-05-18T04:16: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":"Both IP lookup and packet classification in IP routers can be implemented by some form of tree traversal. SRAM-based Pipelining can improve the throughput dramatically. However, previous pipelining schemes result in unbalanced memory allocation over the pipeline stages. This has been identified as a major challenge for scalable pipelined solutions. This paper proposes a flexible bidirectional linear pipeline architecture based on widely-used dual-port SRAMs. A search tree is partitioned, and then mapped onto pipeline stages by a bidirectional fine-grained mapping scheme. We introduce the notio","authors_text":"Hoang Le, Viktor K. Prasanna, Weirong Jiang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-27T03:01:36Z","title":"Bidirectional Pipelining for Scalable IP Lookup and Packet Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5372","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:c53d913ffaee96ad09e9b8a73153c4235cf68a4bc1b1fd9c9e22f0088c0f5cf2","target":"record","created_at":"2026-05-18T04:16: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":"fc61d82fd5805c23225f84eb8148796457f9b9df55f22d73aaf2558234a9da08","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-27T03:01:36Z","title_canon_sha256":"11ca6f26d3052000ed633ee978aaff6169592de97ff8c264beac8f627cbf518d"},"schema_version":"1.0","source":{"id":"1107.5372","kind":"arxiv","version":1}},"canonical_sha256":"89c5e0e5fe3b9289395b74f5feeffbefc614f69bda9ac1d67517450277a31fcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89c5e0e5fe3b9289395b74f5feeffbefc614f69bda9ac1d67517450277a31fcd","first_computed_at":"2026-05-18T04:16:52.177926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:52.177926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RsbmranhjhCQjO/Hdor8JPXS2+CFZwcYpH6mxiMB2R9K5EXzmnQ9z0SuPtIrWAWfFpXPIm8vreW1Aal7ZOnoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:52.178651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c53d913ffaee96ad09e9b8a73153c4235cf68a4bc1b1fd9c9e22f0088c0f5cf2","sha256:f5dd1b90dccef039a09d2224cf4f5c44ca4d0f8c69eb662e3c49e64835969f66"],"state_sha256":"ccb2519e812ee92d67049e6957135e2e557673415a97214ec82cb45f39b2d299"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBibz8OCPKjvMJgtVTeP1/DdqJVzKBBTDSNsdKL8y20/v9HDYX1W6/ZgB4M9cBegH7DUbc8ah0Ohom3cQF+3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:13:06.517097Z","bundle_sha256":"871f0b09a538f48cddc3aa5647a7ea2285d6815b80b0ff5fc5401b70c6beae34"}}