{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5U2WGJBGVWP67XNNIOA43EEDR4","short_pith_number":"pith:5U2WGJBG","schema_version":"1.0","canonical_sha256":"ed35632426ad9fefddad4381cd90838f0b8efaac1af6ee1e77868439b1d519e6","source":{"kind":"arxiv","id":"2501.03871","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Complexity of Segment Routing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Andr\\'e Nichterlein, Camille Richer, Cristina Bazgan, Morgan Chopin","submitted_at":"2025-01-07T15:36:44Z","abstract_excerpt":"Segment Routing is a recent network technology that helps optimizing network throughput by providing finer control over the routing paths. Instead of routing directly from a source to a target, packets are routed via intermediate waypoints. Between consecutive waypoints, the packets are routed according to traditional shortest path routing protocols. Bottlenecks in the network can be avoided by such rerouting, preventing overloading parts of the network. The associated NP-hard computational problem is Segment Routing: Given a network on $n$ vertices, $d$ traffic demands (vertex pairs), and a ("},"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":"2501.03871","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2025-01-07T15:36:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d59bb98ace0b874a60a5b663ff1a5d6fa62e2762209f9ad37425ef4afd6e18ba","abstract_canon_sha256":"0dcd1666e005463d88dfa605f233dc3e72e4520811d4d69a9913980297c5c538"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:01.724968Z","signature_b64":"OYX+zxpvR78aTObaKTZrvdU1j9cdHSyIwoYnn0+xk06L+Yb3oPhCNR/VPNaQBERonJ5/BBggIyWaNBysRTwAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed35632426ad9fefddad4381cd90838f0b8efaac1af6ee1e77868439b1d519e6","last_reissued_at":"2026-07-05T09:58:01.724519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:01.724519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Segment Routing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Andr\\'e Nichterlein, Camille Richer, Cristina Bazgan, Morgan Chopin","submitted_at":"2025-01-07T15:36:44Z","abstract_excerpt":"Segment Routing is a recent network technology that helps optimizing network throughput by providing finer control over the routing paths. Instead of routing directly from a source to a target, packets are routed via intermediate waypoints. Between consecutive waypoints, the packets are routed according to traditional shortest path routing protocols. Bottlenecks in the network can be avoided by such rerouting, preventing overloading parts of the network. The associated NP-hard computational problem is Segment Routing: Given a network on $n$ vertices, $d$ traffic demands (vertex pairs), and a ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03871","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.03871/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.03871","created_at":"2026-07-05T09:58:01.724569+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.03871v1","created_at":"2026-07-05T09:58:01.724569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03871","created_at":"2026-07-05T09:58:01.724569+00:00"},{"alias_kind":"pith_short_12","alias_value":"5U2WGJBGVWP6","created_at":"2026-07-05T09:58:01.724569+00:00"},{"alias_kind":"pith_short_16","alias_value":"5U2WGJBGVWP67XNN","created_at":"2026-07-05T09:58:01.724569+00:00"},{"alias_kind":"pith_short_8","alias_value":"5U2WGJBG","created_at":"2026-07-05T09:58:01.724569+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/5U2WGJBGVWP67XNNIOA43EEDR4","json":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4.json","graph_json":"https://pith.science/api/pith-number/5U2WGJBGVWP67XNNIOA43EEDR4/graph.json","events_json":"https://pith.science/api/pith-number/5U2WGJBGVWP67XNNIOA43EEDR4/events.json","paper":"https://pith.science/paper/5U2WGJBG"},"agent_actions":{"view_html":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4","download_json":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4.json","view_paper":"https://pith.science/paper/5U2WGJBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.03871&json=true","fetch_graph":"https://pith.science/api/pith-number/5U2WGJBGVWP67XNNIOA43EEDR4/graph.json","fetch_events":"https://pith.science/api/pith-number/5U2WGJBGVWP67XNNIOA43EEDR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4/action/storage_attestation","attest_author":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4/action/author_attestation","sign_citation":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4/action/citation_signature","submit_replication":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4/action/replication_record"}},"created_at":"2026-07-05T09:58:01.724569+00:00","updated_at":"2026-07-05T09:58:01.724569+00:00"}