{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:PEIXHQERLB7D5SVORYMZEQER22","short_pith_number":"pith:PEIXHQER","canonical_record":{"source":{"id":"2411.18312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T13:07:04Z","cross_cats_sorted":[],"title_canon_sha256":"a8e87c3ae0fa3fafce5c064286b50e0c9d8119c0b8484ebf8aff3078d38718e3","abstract_canon_sha256":"0c5d8eada517ff832ca48f0af21a2cf004feac49137f2e814ade0be0d41c099a"},"schema_version":"1.0"},"canonical_sha256":"791173c091587e3ecaae8e19924091d6ab84f302f1e0fe51bd99b77abfda7943","source":{"kind":"arxiv","id":"2411.18312","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.18312","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"2411.18312v1","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18312","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"PEIXHQERLB7D","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_16","alias_value":"PEIXHQERLB7D5SVO","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_8","alias_value":"PEIXHQER","created_at":"2026-07-05T09:41:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:PEIXHQERLB7D5SVORYMZEQER22","target":"record","payload":{"canonical_record":{"source":{"id":"2411.18312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T13:07:04Z","cross_cats_sorted":[],"title_canon_sha256":"a8e87c3ae0fa3fafce5c064286b50e0c9d8119c0b8484ebf8aff3078d38718e3","abstract_canon_sha256":"0c5d8eada517ff832ca48f0af21a2cf004feac49137f2e814ade0be0d41c099a"},"schema_version":"1.0"},"canonical_sha256":"791173c091587e3ecaae8e19924091d6ab84f302f1e0fe51bd99b77abfda7943","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:14.735040Z","signature_b64":"R1cpkqQVr6d0FIuYjnUXCdJzW10x4R1tTkbsjjUEvqvuvzb05bG2A/LQmosdS4UHiHSvH06pzfr2kaLwgq7sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"791173c091587e3ecaae8e19924091d6ab84f302f1e0fe51bd99b77abfda7943","last_reissued_at":"2026-07-05T09:41:14.734560Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:14.734560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.18312","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:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMqay8HUG5OGMWpDdh8clGBdnIXChRNKY31+BGg1UhzyY+bjrpg5hy4WTbwd0IGUQEIhXgv0HqZYcWdh4/VxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:59:26.605474Z"},"content_sha256":"5f3f4c3e3bf788e4ba1d8f8836dba197fb9ebe3ae9ba6ba84cdcfd2afa3a4466","schema_version":"1.0","event_id":"sha256:5f3f4c3e3bf788e4ba1d8f8836dba197fb9ebe3ae9ba6ba84cdcfd2afa3a4466"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:PEIXHQERLB7D5SVORYMZEQER22","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benyu Wang, Ran Duan, Shucheng Chi, Tianle Xie","submitted_at":"2024-11-27T13:07:04Z","abstract_excerpt":"Given a graph $G=(V,E)$ and two vertices $s,t\\in V$, the $f$-fault replacement path ($f$FRP) problem computes for every set of edges $F$ where $|F|\\leq f$, the distance from $s$ to $t$ when edges in $F$ fail. A recent result shows that 2FRP in directed graphs can be solved in $\\tilde{O}(n^3)$ time [arXiv:2209.07016]. In this paper, we show a 3FRP algorithm in deterministic $\\tilde{O}(n^3)$ time for undirected weighted graphs, which almost matches the size of the output. This implies that $f$FRP in undirected graphs can be solved in almost optimal $\\tilde{O}(n^f)$ time for all $f\\geq 3$. To con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18312","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/2411.18312/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:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOSnFKrYqillSKmBATZ7yN8DYtlm5oMTqjux4SGZuVyr5NQRqoDvSLcniB6ZMlypy9mk0p8ig4snpVNDOrLEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:59:26.605975Z"},"content_sha256":"9896700af8edec29117981f90c8c97ebc2a3097c85d5a7fe1fd913195a1b8570","schema_version":"1.0","event_id":"sha256:9896700af8edec29117981f90c8c97ebc2a3097c85d5a7fe1fd913195a1b8570"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PEIXHQERLB7D5SVORYMZEQER22/bundle.json","state_url":"https://pith.science/pith/PEIXHQERLB7D5SVORYMZEQER22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PEIXHQERLB7D5SVORYMZEQER22/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-13T08:59:26Z","links":{"resolver":"https://pith.science/pith/PEIXHQERLB7D5SVORYMZEQER22","bundle":"https://pith.science/pith/PEIXHQERLB7D5SVORYMZEQER22/bundle.json","state":"https://pith.science/pith/PEIXHQERLB7D5SVORYMZEQER22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PEIXHQERLB7D5SVORYMZEQER22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PEIXHQERLB7D5SVORYMZEQER22","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":"0c5d8eada517ff832ca48f0af21a2cf004feac49137f2e814ade0be0d41c099a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T13:07:04Z","title_canon_sha256":"a8e87c3ae0fa3fafce5c064286b50e0c9d8119c0b8484ebf8aff3078d38718e3"},"schema_version":"1.0","source":{"id":"2411.18312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.18312","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"2411.18312v1","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18312","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"PEIXHQERLB7D","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_16","alias_value":"PEIXHQERLB7D5SVO","created_at":"2026-07-05T09:41:14Z"},{"alias_kind":"pith_short_8","alias_value":"PEIXHQER","created_at":"2026-07-05T09:41:14Z"}],"graph_snapshots":[{"event_id":"sha256:9896700af8edec29117981f90c8c97ebc2a3097c85d5a7fe1fd913195a1b8570","target":"graph","created_at":"2026-07-05T09:41:14Z","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/2411.18312/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $G=(V,E)$ and two vertices $s,t\\in V$, the $f$-fault replacement path ($f$FRP) problem computes for every set of edges $F$ where $|F|\\leq f$, the distance from $s$ to $t$ when edges in $F$ fail. A recent result shows that 2FRP in directed graphs can be solved in $\\tilde{O}(n^3)$ time [arXiv:2209.07016]. In this paper, we show a 3FRP algorithm in deterministic $\\tilde{O}(n^3)$ time for undirected weighted graphs, which almost matches the size of the output. This implies that $f$FRP in undirected graphs can be solved in almost optimal $\\tilde{O}(n^f)$ time for all $f\\geq 3$. To con","authors_text":"Benyu Wang, Ran Duan, Shucheng Chi, Tianle Xie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18312","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:5f3f4c3e3bf788e4ba1d8f8836dba197fb9ebe3ae9ba6ba84cdcfd2afa3a4466","target":"record","created_at":"2026-07-05T09:41:14Z","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":"0c5d8eada517ff832ca48f0af21a2cf004feac49137f2e814ade0be0d41c099a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T13:07:04Z","title_canon_sha256":"a8e87c3ae0fa3fafce5c064286b50e0c9d8119c0b8484ebf8aff3078d38718e3"},"schema_version":"1.0","source":{"id":"2411.18312","kind":"arxiv","version":1}},"canonical_sha256":"791173c091587e3ecaae8e19924091d6ab84f302f1e0fe51bd99b77abfda7943","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"791173c091587e3ecaae8e19924091d6ab84f302f1e0fe51bd99b77abfda7943","first_computed_at":"2026-07-05T09:41:14.734560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:14.734560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R1cpkqQVr6d0FIuYjnUXCdJzW10x4R1tTkbsjjUEvqvuvzb05bG2A/LQmosdS4UHiHSvH06pzfr2kaLwgq7sCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:14.735040Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.18312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f3f4c3e3bf788e4ba1d8f8836dba197fb9ebe3ae9ba6ba84cdcfd2afa3a4466","sha256:9896700af8edec29117981f90c8c97ebc2a3097c85d5a7fe1fd913195a1b8570"],"state_sha256":"0527d658234e4341c96498bbf3ec0fbcda752838a4af81ba3771370379f1c762"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9uVmENrZglY7omAUV4TX2jovgBIcY5WZc+OnGB+sFsgHJyMqUVZny3mG0c0u0Bb9e6sUrXKnAyO2qIC1e7A3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:59:26.611413Z","bundle_sha256":"3d7cf7813a5d7711d238d612524f57c3e02fbb02d086ae7a14994fb2a7e40e33"}}