{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GZPAMJM4ESZ6DUS23ZKSQELLJJ","short_pith_number":"pith:GZPAMJM4","schema_version":"1.0","canonical_sha256":"365e06259c24b3e1d25ade5528116b4a748baebc5b4d5387391ad63476645863","source":{"kind":"arxiv","id":"1507.07217","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.07217","created_at":"2026-05-18T00:41:53.873370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07217v2","created_at":"2026-05-18T00:41:53.873370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07217","created_at":"2026-05-18T00:41:53.873370+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZPAMJM4ESZ6","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZPAMJM4ESZ6DUS2","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZPAMJM4","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ","json":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ.json","graph_json":"https://pith.science/api/pith-number/GZPAMJM4ESZ6DUS23ZKSQELLJJ/graph.json","events_json":"https://pith.science/api/pith-number/GZPAMJM4ESZ6DUS23ZKSQELLJJ/events.json","paper":"https://pith.science/paper/GZPAMJM4"},"agent_actions":{"view_html":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ","download_json":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ.json","view_paper":"https://pith.science/paper/GZPAMJM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07217&json=true","fetch_graph":"https://pith.science/api/pith-number/GZPAMJM4ESZ6DUS23ZKSQELLJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GZPAMJM4ESZ6DUS23ZKSQELLJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/action/storage_attestation","attest_author":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/action/author_attestation","sign_citation":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/action/citation_signature","submit_replication":"https://pith.science/pith/GZPAMJM4ESZ6DUS23ZKSQELLJJ/action/replication_record"}},"created_at":"2026-05-18T00:41:53.873370+00:00","updated_at":"2026-05-18T00:41:53.873370+00:00"}