{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5LFSUVMZGLOYVE7HZEESLDMBYZ","short_pith_number":"pith:5LFSUVMZ","canonical_record":{"source":{"id":"1902.10319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-27T03:24:40Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c416827e9249035606bb835aa8c12ce00ffe80c7454216369366ed0e0788d711","abstract_canon_sha256":"3ed2ccee846b375f1d0767647d54dab050f8de40ad754a1ed9442a41f50cb899"},"schema_version":"1.0"},"canonical_sha256":"eacb2a559932dd8a93e7c909258d81c660a58352867f5ed05bc723e9ed6ab609","source":{"kind":"arxiv","id":"1902.10319","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10319","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10319v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10319","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"5LFSUVMZGLOY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5LFSUVMZGLOYVE7H","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5LFSUVMZ","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5LFSUVMZGLOYVE7HZEESLDMBYZ","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-27T03:24:40Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c416827e9249035606bb835aa8c12ce00ffe80c7454216369366ed0e0788d711","abstract_canon_sha256":"3ed2ccee846b375f1d0767647d54dab050f8de40ad754a1ed9442a41f50cb899"},"schema_version":"1.0"},"canonical_sha256":"eacb2a559932dd8a93e7c909258d81c660a58352867f5ed05bc723e9ed6ab609","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.213504Z","signature_b64":"CDr1GlZkZElqsFQHLXY+QacPZsNn1UnrPjEdOIo7Skn9htH62D97O3eEtDjtPacL94ESJNleKLu0f8ZrUehbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eacb2a559932dd8a93e7c909258d81c660a58352867f5ed05bc723e9ed6ab609","last_reissued_at":"2026-05-17T23:52:31.212872Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.212872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10319","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wr9d56sezj1jS4LyOy3PU7uR8tcncwZfkK+jH5RD8A0XDI+u7axxopEZAt1De4Wk/v+/88NkWBsNExIAoDc5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:40:17.220563Z"},"content_sha256":"8c3ffcd660e909ee2b23ab0edfe93bbe6632383086560184605b3ad95d5f3fae","schema_version":"1.0","event_id":"sha256:8c3ffcd660e909ee2b23ab0edfe93bbe6632383086560184605b3ad95d5f3fae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5LFSUVMZGLOYVE7HZEESLDMBYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Packet Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NI","authors_text":"Eric Liang, Hang Zhu, Ion Stoica, Xin Jin","submitted_at":"2019-02-27T03:24:40Z","abstract_excerpt":"Packet classification is a fundamental problem in computer networking. This problem exposes a hard tradeoff between the computation and state complexity, which makes it particularly challenging. To navigate this tradeoff, existing solutions rely on complex hand-tuned heuristics, which are brittle and hard to optimize. In this paper, we propose a deep reinforcement learning (RL) approach to solve the packet classification problem. There are several characteristics that make this problem a good fit for Deep RL. First, many of the existing solutions are iteratively building a decision tree by spl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10319","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQIEwoMoMcqu8jJwI7NPiL/Td/8OjrmwL8/pDR5bIx+K0d0/0f1IUvcCo7JabW0+Zep0nBKIwfznVTJz4jASAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:40:17.221128Z"},"content_sha256":"bd93b26e736a96fe4f07dd33c929b87157dff57ccd4b3959da4eb2f3a018829f","schema_version":"1.0","event_id":"sha256:bd93b26e736a96fe4f07dd33c929b87157dff57ccd4b3959da4eb2f3a018829f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LFSUVMZGLOYVE7HZEESLDMBYZ/bundle.json","state_url":"https://pith.science/pith/5LFSUVMZGLOYVE7HZEESLDMBYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LFSUVMZGLOYVE7HZEESLDMBYZ/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-08-15T13:40:17Z","links":{"resolver":"https://pith.science/pith/5LFSUVMZGLOYVE7HZEESLDMBYZ","bundle":"https://pith.science/pith/5LFSUVMZGLOYVE7HZEESLDMBYZ/bundle.json","state":"https://pith.science/pith/5LFSUVMZGLOYVE7HZEESLDMBYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LFSUVMZGLOYVE7HZEESLDMBYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5LFSUVMZGLOYVE7HZEESLDMBYZ","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":"3ed2ccee846b375f1d0767647d54dab050f8de40ad754a1ed9442a41f50cb899","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-27T03:24:40Z","title_canon_sha256":"c416827e9249035606bb835aa8c12ce00ffe80c7454216369366ed0e0788d711"},"schema_version":"1.0","source":{"id":"1902.10319","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10319","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10319v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10319","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"5LFSUVMZGLOY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5LFSUVMZGLOYVE7H","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5LFSUVMZ","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:bd93b26e736a96fe4f07dd33c929b87157dff57ccd4b3959da4eb2f3a018829f","target":"graph","created_at":"2026-05-17T23:52:31Z","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":"Packet classification is a fundamental problem in computer networking. This problem exposes a hard tradeoff between the computation and state complexity, which makes it particularly challenging. To navigate this tradeoff, existing solutions rely on complex hand-tuned heuristics, which are brittle and hard to optimize. In this paper, we propose a deep reinforcement learning (RL) approach to solve the packet classification problem. There are several characteristics that make this problem a good fit for Deep RL. First, many of the existing solutions are iteratively building a decision tree by spl","authors_text":"Eric Liang, Hang Zhu, Ion Stoica, Xin Jin","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-27T03:24:40Z","title":"Neural Packet Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10319","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:8c3ffcd660e909ee2b23ab0edfe93bbe6632383086560184605b3ad95d5f3fae","target":"record","created_at":"2026-05-17T23:52:31Z","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":"3ed2ccee846b375f1d0767647d54dab050f8de40ad754a1ed9442a41f50cb899","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-27T03:24:40Z","title_canon_sha256":"c416827e9249035606bb835aa8c12ce00ffe80c7454216369366ed0e0788d711"},"schema_version":"1.0","source":{"id":"1902.10319","kind":"arxiv","version":1}},"canonical_sha256":"eacb2a559932dd8a93e7c909258d81c660a58352867f5ed05bc723e9ed6ab609","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eacb2a559932dd8a93e7c909258d81c660a58352867f5ed05bc723e9ed6ab609","first_computed_at":"2026-05-17T23:52:31.212872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:31.212872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CDr1GlZkZElqsFQHLXY+QacPZsNn1UnrPjEdOIo7Skn9htH62D97O3eEtDjtPacL94ESJNleKLu0f8ZrUehbAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:31.213504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10319","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c3ffcd660e909ee2b23ab0edfe93bbe6632383086560184605b3ad95d5f3fae","sha256:bd93b26e736a96fe4f07dd33c929b87157dff57ccd4b3959da4eb2f3a018829f"],"state_sha256":"8c0af1b639f25856a46119b5a08e31958c35f4c3ec5116395df1291a0eb60b18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1rAMihIqPE7AJF6RPU2BH1MIuEvIVS6MFKOkVw/tAo7HWZIQFyTGbTILNSbSwGRQP2FIDOor6F90r1tlCPlAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T13:40:17.225998Z","bundle_sha256":"f3413b1de0776ad805db9e2b025973f3a3f0adbe499244b01cc2869374e18e76"}}