{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3D6KYIBEXCMJM6V5LBSQS7DBGQ","short_pith_number":"pith:3D6KYIBE","canonical_record":{"source":{"id":"2205.14797","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-30T00:50:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"116cc14533441e83f63e1dd3612b1937ee09a82471ecba39d05127451f8cdce9","abstract_canon_sha256":"0c3c38d00fbc9031661d03282a891a7dacc515b5fc23551dd4e80b035034e2cc"},"schema_version":"1.0"},"canonical_sha256":"d8fcac2024b898967abd5865097c61340898e2d1a763d6f67573208b823df442","source":{"kind":"arxiv","id":"2205.14797","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14797","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14797v2","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14797","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_12","alias_value":"3D6KYIBEXCMJ","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_16","alias_value":"3D6KYIBEXCMJM6V5","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_8","alias_value":"3D6KYIBE","created_at":"2026-07-05T08:21:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3D6KYIBEXCMJM6V5LBSQS7DBGQ","target":"record","payload":{"canonical_record":{"source":{"id":"2205.14797","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-30T00:50:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"116cc14533441e83f63e1dd3612b1937ee09a82471ecba39d05127451f8cdce9","abstract_canon_sha256":"0c3c38d00fbc9031661d03282a891a7dacc515b5fc23551dd4e80b035034e2cc"},"schema_version":"1.0"},"canonical_sha256":"d8fcac2024b898967abd5865097c61340898e2d1a763d6f67573208b823df442","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:03.172003Z","signature_b64":"06umC0FsLqNg71pEdoM+IVcehtgcPRxbltNazTSKyhTJQP5lUgZQ7fD+uHdcSPm3d1BMSiRl2Ibu5mFfBS2OAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8fcac2024b898967abd5865097c61340898e2d1a763d6f67573208b823df442","last_reissued_at":"2026-07-05T08:21:03.171603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:03.171603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.14797","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-07-05T08:21:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZwVThCcw/qy7bGoEe5KeuqozWTgF8755Si0KmxJCgmfyDMCLgmH6lbsloTS2h4B41LnJ11Pgc+jXg6ZTopgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T09:16:01.435524Z"},"content_sha256":"629a59eadfb284b2a87a683581f803b4d540e632c607fcc325be71afabee465e","schema_version":"1.0","event_id":"sha256:629a59eadfb284b2a87a683581f803b4d540e632c607fcc325be71afabee465e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3D6KYIBEXCMJM6V5LBSQS7DBGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Vignesh Manoharan, Vijaya Ramachandran","submitted_at":"2022-05-30T00:50:28Z","abstract_excerpt":"We present several results in the CONGEST model on round complexity for Replacement Paths (RPaths), Minimum Weight Cycle (MWC), and All Nodes Shortest Cycles (ANSC). We study these fundamental problems in both directed and undirected graphs, both weighted and unweighted. Many of our results are optimal to within a polylog factor: For an $n$-node graph $G$ we establish near linear lower and upper bounds for computing RPaths if $G$ is directed and weighted, and for computing MWC and ANSC if $G$ is weighted, directed or undirected; near $\\sqrt{n}$ lower and upper bounds for undirected weighted RP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14797","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.14797/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-05T08:21:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaOM+6b/dAxe9B1zklYzXly2mP54jZM5BUmf3U+7uPBIDCbXR7thfzPlKfWZN2WFSEC5pxKsF59FyGvekSmvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T09:16:01.435953Z"},"content_sha256":"ed69e9a0c347a769878e6b730ffec3ddc8cd80570bbbc2bce9b1b6a4dcf59bcd","schema_version":"1.0","event_id":"sha256:ed69e9a0c347a769878e6b730ffec3ddc8cd80570bbbc2bce9b1b6a4dcf59bcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3D6KYIBEXCMJM6V5LBSQS7DBGQ/bundle.json","state_url":"https://pith.science/pith/3D6KYIBEXCMJM6V5LBSQS7DBGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3D6KYIBEXCMJM6V5LBSQS7DBGQ/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-19T09:16:01Z","links":{"resolver":"https://pith.science/pith/3D6KYIBEXCMJM6V5LBSQS7DBGQ","bundle":"https://pith.science/pith/3D6KYIBEXCMJM6V5LBSQS7DBGQ/bundle.json","state":"https://pith.science/pith/3D6KYIBEXCMJM6V5LBSQS7DBGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3D6KYIBEXCMJM6V5LBSQS7DBGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3D6KYIBEXCMJM6V5LBSQS7DBGQ","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":"0c3c38d00fbc9031661d03282a891a7dacc515b5fc23551dd4e80b035034e2cc","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-30T00:50:28Z","title_canon_sha256":"116cc14533441e83f63e1dd3612b1937ee09a82471ecba39d05127451f8cdce9"},"schema_version":"1.0","source":{"id":"2205.14797","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14797","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14797v2","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14797","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_12","alias_value":"3D6KYIBEXCMJ","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_16","alias_value":"3D6KYIBEXCMJM6V5","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_8","alias_value":"3D6KYIBE","created_at":"2026-07-05T08:21:03Z"}],"graph_snapshots":[{"event_id":"sha256:ed69e9a0c347a769878e6b730ffec3ddc8cd80570bbbc2bce9b1b6a4dcf59bcd","target":"graph","created_at":"2026-07-05T08:21:03Z","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/2205.14797/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present several results in the CONGEST model on round complexity for Replacement Paths (RPaths), Minimum Weight Cycle (MWC), and All Nodes Shortest Cycles (ANSC). We study these fundamental problems in both directed and undirected graphs, both weighted and unweighted. Many of our results are optimal to within a polylog factor: For an $n$-node graph $G$ we establish near linear lower and upper bounds for computing RPaths if $G$ is directed and weighted, and for computing MWC and ANSC if $G$ is weighted, directed or undirected; near $\\sqrt{n}$ lower and upper bounds for undirected weighted RP","authors_text":"Vignesh Manoharan, Vijaya Ramachandran","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-30T00:50:28Z","title":"Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14797","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:629a59eadfb284b2a87a683581f803b4d540e632c607fcc325be71afabee465e","target":"record","created_at":"2026-07-05T08:21:03Z","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":"0c3c38d00fbc9031661d03282a891a7dacc515b5fc23551dd4e80b035034e2cc","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-30T00:50:28Z","title_canon_sha256":"116cc14533441e83f63e1dd3612b1937ee09a82471ecba39d05127451f8cdce9"},"schema_version":"1.0","source":{"id":"2205.14797","kind":"arxiv","version":2}},"canonical_sha256":"d8fcac2024b898967abd5865097c61340898e2d1a763d6f67573208b823df442","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8fcac2024b898967abd5865097c61340898e2d1a763d6f67573208b823df442","first_computed_at":"2026-07-05T08:21:03.171603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:21:03.171603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"06umC0FsLqNg71pEdoM+IVcehtgcPRxbltNazTSKyhTJQP5lUgZQ7fD+uHdcSPm3d1BMSiRl2Ibu5mFfBS2OAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:21:03.172003Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.14797","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:629a59eadfb284b2a87a683581f803b4d540e632c607fcc325be71afabee465e","sha256:ed69e9a0c347a769878e6b730ffec3ddc8cd80570bbbc2bce9b1b6a4dcf59bcd"],"state_sha256":"7bbd30740a00d18d445486da99651a2966342585724cddf5b98c6e4e2fbf4d37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/+YDG2C/qzdw6SBJjbpTJ3pdJULdB46iFwOfPk9HMCIPVVQYT+PpG8hiNYXxLF2u063ReBRqG/jytPRCUyHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T09:16:01.438895Z","bundle_sha256":"d617682d1b8aefd8520d9ff21daf47f1781cd3f814a2c3aa03a9eef021013c17"}}