{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5U2WGJBGVWP67XNNIOA43EEDR4","short_pith_number":"pith:5U2WGJBG","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"},"canonical_sha256":"ed35632426ad9fefddad4381cd90838f0b8efaac1af6ee1e77868439b1d519e6","source":{"kind":"arxiv","id":"2501.03871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.03871","created_at":"2026-07-05T09:58:01Z"},{"alias_kind":"arxiv_version","alias_value":"2501.03871v1","created_at":"2026-07-05T09:58:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03871","created_at":"2026-07-05T09:58:01Z"},{"alias_kind":"pith_short_12","alias_value":"5U2WGJBGVWP6","created_at":"2026-07-05T09:58:01Z"},{"alias_kind":"pith_short_16","alias_value":"5U2WGJBGVWP67XNN","created_at":"2026-07-05T09:58:01Z"},{"alias_kind":"pith_short_8","alias_value":"5U2WGJBG","created_at":"2026-07-05T09:58:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5U2WGJBGVWP67XNNIOA43EEDR4","target":"record","payload":{"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"},"canonical_sha256":"ed35632426ad9fefddad4381cd90838f0b8efaac1af6ee1e77868439b1d519e6","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"},"source_kind":"arxiv","source_id":"2501.03871","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-07-05T09:58:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkydGDt3Z28jabbgvWyQOn7W4Eepsb4kSLHfINXInbJrVKtEnxxjJ7N7K8slN149u//SjUxARDKdtilrjKodBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:18:25.761068Z"},"content_sha256":"84db9c394963284c1c88149a0ba2299495e68db5e3ccd42974aa1f18cb927212","schema_version":"1.0","event_id":"sha256:84db9c394963284c1c88149a0ba2299495e68db5e3ccd42974aa1f18cb927212"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5U2WGJBGVWP67XNNIOA43EEDR4","target":"graph","payload":{"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"},"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-07-05T09:58:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2Onux3tJvWj8lPOgfYWAcsW66ub26SIaSAMpfilDzm4EK6HfMd9y5ooNayD5OCkBVziqYWOounPT5xlf+PLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:18:25.761458Z"},"content_sha256":"5a077ee7dc138069bbc20aae3d86b43f5ddd1fb9f09b2e031a96e4b15deb7b10","schema_version":"1.0","event_id":"sha256:5a077ee7dc138069bbc20aae3d86b43f5ddd1fb9f09b2e031a96e4b15deb7b10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4/bundle.json","state_url":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5U2WGJBGVWP67XNNIOA43EEDR4/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-07-06T23:18:25Z","links":{"resolver":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4","bundle":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4/bundle.json","state":"https://pith.science/pith/5U2WGJBGVWP67XNNIOA43EEDR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5U2WGJBGVWP67XNNIOA43EEDR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5U2WGJBGVWP67XNNIOA43EEDR4","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":"0dcd1666e005463d88dfa605f233dc3e72e4520811d4d69a9913980297c5c538","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2025-01-07T15:36:44Z","title_canon_sha256":"d59bb98ace0b874a60a5b663ff1a5d6fa62e2762209f9ad37425ef4afd6e18ba"},"schema_version":"1.0","source":{"id":"2501.03871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.03871","created_at":"2026-07-05T09:58:01Z"},{"alias_kind":"arxiv_version","alias_value":"2501.03871v1","created_at":"2026-07-05T09:58:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03871","created_at":"2026-07-05T09:58:01Z"},{"alias_kind":"pith_short_12","alias_value":"5U2WGJBGVWP6","created_at":"2026-07-05T09:58:01Z"},{"alias_kind":"pith_short_16","alias_value":"5U2WGJBGVWP67XNN","created_at":"2026-07-05T09:58:01Z"},{"alias_kind":"pith_short_8","alias_value":"5U2WGJBG","created_at":"2026-07-05T09:58:01Z"}],"graph_snapshots":[{"event_id":"sha256:5a077ee7dc138069bbc20aae3d86b43f5ddd1fb9f09b2e031a96e4b15deb7b10","target":"graph","created_at":"2026-07-05T09:58:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.03871/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 (","authors_text":"Andr\\'e Nichterlein, Camille Richer, Cristina Bazgan, Morgan Chopin","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2025-01-07T15:36:44Z","title":"Parameterized Complexity of Segment Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03871","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:84db9c394963284c1c88149a0ba2299495e68db5e3ccd42974aa1f18cb927212","target":"record","created_at":"2026-07-05T09:58:01Z","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":"0dcd1666e005463d88dfa605f233dc3e72e4520811d4d69a9913980297c5c538","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2025-01-07T15:36:44Z","title_canon_sha256":"d59bb98ace0b874a60a5b663ff1a5d6fa62e2762209f9ad37425ef4afd6e18ba"},"schema_version":"1.0","source":{"id":"2501.03871","kind":"arxiv","version":1}},"canonical_sha256":"ed35632426ad9fefddad4381cd90838f0b8efaac1af6ee1e77868439b1d519e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed35632426ad9fefddad4381cd90838f0b8efaac1af6ee1e77868439b1d519e6","first_computed_at":"2026-07-05T09:58:01.724519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:58:01.724519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OYX+zxpvR78aTObaKTZrvdU1j9cdHSyIwoYnn0+xk06L+Yb3oPhCNR/VPNaQBERonJ5/BBggIyWaNBysRTwAAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:58:01.724968Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.03871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84db9c394963284c1c88149a0ba2299495e68db5e3ccd42974aa1f18cb927212","sha256:5a077ee7dc138069bbc20aae3d86b43f5ddd1fb9f09b2e031a96e4b15deb7b10"],"state_sha256":"19285403cfc4e4d292223496194cc1c840cd35b5168b8ddd56feea037e437bc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ZgqRAL+ueTo9xHz99MyzEE4jhUFQKl1K7aeTVH030BLwf+TZ/UilTy3FBllyvvDhPk5syV2C4TLchV0LUoCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:18:25.763663Z","bundle_sha256":"5127c704ee0a7c11ad6882b26a9d4fc4180393c0c42433a7106f5c8f5af5eb6b"}}