{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GZPAMJM4ESZ6DUS23ZKSQELLJJ","short_pith_number":"pith:GZPAMJM4","canonical_record":{"source":{"id":"1507.07217","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-26T16:20:30Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ee62792c0e9bc435ffe3f777bcd43c1e2f953c2afae0493fc52643cdc4ec51fb","abstract_canon_sha256":"0297d6cec156287e0d374123867bb904defb99783b756b10da07ef028ddd06ae"},"schema_version":"1.0"},"canonical_sha256":"365e06259c24b3e1d25ade5528116b4a748baebc5b4d5387391ad63476645863","source":{"kind":"arxiv","id":"1507.07217","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07217","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07217v2","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07217","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"GZPAMJM4ESZ6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GZPAMJM4ESZ6DUS2","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GZPAMJM4","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GZPAMJM4ESZ6DUS23ZKSQELLJJ","target":"record","payload":{"canonical_record":{"source":{"id":"1507.07217","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-26T16:20:30Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ee62792c0e9bc435ffe3f777bcd43c1e2f953c2afae0493fc52643cdc4ec51fb","abstract_canon_sha256":"0297d6cec156287e0d374123867bb904defb99783b756b10da07ef028ddd06ae"},"schema_version":"1.0"},"canonical_sha256":"365e06259c24b3e1d25ade5528116b4a748baebc5b4d5387391ad63476645863","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:53.873981Z","signature_b64":"MNOzLKe4IWpUL7/nzojZVuDW26ZeathN2z7VVgpgn4sb2s8dlnT0L+o3LEKHYEVPLa0Bs80gJpe14jyWu3F/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"365e06259c24b3e1d25ade5528116b4a748baebc5b4d5387391ad63476645863","last_reissued_at":"2026-05-18T00:41:53.873261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:53.873261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.07217","source_version":2,"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-18T00:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dkhZB8yWAwXBL6bf2to+Fu5zjp6cRi3WrVNF74D8f56OSQQGIMbIyvMoE89yNwWPZJI4pSol3VDGjGnUnzaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:29:47.435273Z"},"content_sha256":"3938d5241926463547691c1a662f8be524213c6b0d27e7e406d39399cc226fb9","schema_version":"1.0","event_id":"sha256:3938d5241926463547691c1a662f8be524213c6b0d27e7e406d39399cc226fb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GZPAMJM4ESZ6DUS23ZKSQELLJJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Problem of Optimal Path Encoding for Software-Defined Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Adiseshu Hari, Gordon Wilfong, Urs Niesen","submitted_at":"2015-07-26T16:20:30Z","abstract_excerpt":"Packet networks need to maintain state in the form of forwarding tables at each switch. The cost of this state increases as networks support ever more sophisticated per-flow routing, traffic engineering, and service chaining. Per-flow or per-path state at the switches can be eliminated by encoding each packet's desired path in its header. A key component of such a method is an efficient encoding of paths through the network. We introduce a mathematical formulation of this optimal path-encoding problem. We prove that the problem is APX-hard, by showing that approximating it to within a factor l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07217","kind":"arxiv","version":2},"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-18T00:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTOuikkzt/3kmSiAkwLg3LXBA8jufT/E9aOX6V8eAlKVT/Z9x+KfzTbUyU5+SoXSV/M2gq7UuXJTH7Q5hHgSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:29:47.435671Z"},"content_sha256":"26aeea75a4326cb65544a3222968d1aaee0db58fe0eedf9f90d819cb4ecf5b06","schema_version":"1.0","event_id":"sha256:26aeea75a4326cb65544a3222968d1aaee0db58fe0eedf9f90d819cb4ecf5b06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/bundle.json","state_url":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/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-09T15:29:47Z","links":{"resolver":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ","bundle":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/bundle.json","state":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GZPAMJM4ESZ6DUS23ZKSQELLJJ","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":"0297d6cec156287e0d374123867bb904defb99783b756b10da07ef028ddd06ae","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-26T16:20:30Z","title_canon_sha256":"ee62792c0e9bc435ffe3f777bcd43c1e2f953c2afae0493fc52643cdc4ec51fb"},"schema_version":"1.0","source":{"id":"1507.07217","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07217","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07217v2","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07217","created_at":"2026-05-18T00:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"GZPAMJM4ESZ6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GZPAMJM4ESZ6DUS2","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GZPAMJM4","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:26aeea75a4326cb65544a3222968d1aaee0db58fe0eedf9f90d819cb4ecf5b06","target":"graph","created_at":"2026-05-18T00:41:53Z","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 networks need to maintain state in the form of forwarding tables at each switch. The cost of this state increases as networks support ever more sophisticated per-flow routing, traffic engineering, and service chaining. Per-flow or per-path state at the switches can be eliminated by encoding each packet's desired path in its header. A key component of such a method is an efficient encoding of paths through the network. We introduce a mathematical formulation of this optimal path-encoding problem. We prove that the problem is APX-hard, by showing that approximating it to within a factor l","authors_text":"Adiseshu Hari, Gordon Wilfong, Urs Niesen","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-26T16:20:30Z","title":"On the Problem of Optimal Path Encoding for Software-Defined Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07217","kind":"arxiv","version":2},"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:3938d5241926463547691c1a662f8be524213c6b0d27e7e406d39399cc226fb9","target":"record","created_at":"2026-05-18T00:41:53Z","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":"0297d6cec156287e0d374123867bb904defb99783b756b10da07ef028ddd06ae","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-26T16:20:30Z","title_canon_sha256":"ee62792c0e9bc435ffe3f777bcd43c1e2f953c2afae0493fc52643cdc4ec51fb"},"schema_version":"1.0","source":{"id":"1507.07217","kind":"arxiv","version":2}},"canonical_sha256":"365e06259c24b3e1d25ade5528116b4a748baebc5b4d5387391ad63476645863","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"365e06259c24b3e1d25ade5528116b4a748baebc5b4d5387391ad63476645863","first_computed_at":"2026-05-18T00:41:53.873261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:53.873261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MNOzLKe4IWpUL7/nzojZVuDW26ZeathN2z7VVgpgn4sb2s8dlnT0L+o3LEKHYEVPLa0Bs80gJpe14jyWu3F/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:53.873981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07217","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3938d5241926463547691c1a662f8be524213c6b0d27e7e406d39399cc226fb9","sha256:26aeea75a4326cb65544a3222968d1aaee0db58fe0eedf9f90d819cb4ecf5b06"],"state_sha256":"b70c937d61a251fb72c53372a1ca9058c89d31cb74717809c2e5e3e998018a35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JOzQsafVQ+DCigTW0atCtRNuQpmR+gomKVPcdcFUTw+4CpQdfTuOWqQ/ZJb5zFv5taSXtP3pAGTx9OeYPTieAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:29:47.438048Z","bundle_sha256":"ec7f4a4f031d7899722ebefa05c7c89caa4123511123d5d1ddaee678662032f9"}}