{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KMJYMECVVFTPLCHWSY6Q2NL6ZL","short_pith_number":"pith:KMJYMECV","canonical_record":{"source":{"id":"1806.06182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-16T04:50:48Z","cross_cats_sorted":[],"title_canon_sha256":"1b3fa3aace0fa47b8c55995130a67963f8f4d058bdf4ef8044a91733df9b0824","abstract_canon_sha256":"e516858a85b3dd3de9552b0fdc5bfdce56a33a422a6351e51986c6a82156ba33"},"schema_version":"1.0"},"canonical_sha256":"5313861055a966f588f6963d0d357ecaf85aa2ef3b90c07771f3ea62a8c35e24","source":{"kind":"arxiv","id":"1806.06182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06182","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06182v1","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06182","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"pith_short_12","alias_value":"KMJYMECVVFTP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KMJYMECVVFTPLCHW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KMJYMECV","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KMJYMECVVFTPLCHWSY6Q2NL6ZL","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-16T04:50:48Z","cross_cats_sorted":[],"title_canon_sha256":"1b3fa3aace0fa47b8c55995130a67963f8f4d058bdf4ef8044a91733df9b0824","abstract_canon_sha256":"e516858a85b3dd3de9552b0fdc5bfdce56a33a422a6351e51986c6a82156ba33"},"schema_version":"1.0"},"canonical_sha256":"5313861055a966f588f6963d0d357ecaf85aa2ef3b90c07771f3ea62a8c35e24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:03.403924Z","signature_b64":"EJLRoNh5rJiYWqibGtMs51OgORVua+ievD2l7Xe7Y1MdJBibja34FS5+7lFNgNZqIJAkDDHT1msUkO38OPKqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5313861055a966f588f6963d0d357ecaf85aa2ef3b90c07771f3ea62a8c35e24","last_reissued_at":"2026-05-18T00:13:03.403268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:03.403268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06182","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-05-18T00:13:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3605ihQ+WcUj0utkn3N+oBKyOg5DTJQ4QubKN2MkP7MevnJy7Xfbeu2ydGm9RGTmWz/5ZzEwteRwroPOWNr7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:13:54.435889Z"},"content_sha256":"2bc07a465148f56038d7ccc0d20f42de84255a41d0c1880b669b8c6084bb7196","schema_version":"1.0","event_id":"sha256:2bc07a465148f56038d7ccc0d20f42de84255a41d0c1880b669b8c6084bb7196"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KMJYMECVVFTPLCHWSY6Q2NL6ZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Distance Sensitivity Oracle for Multiple Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Golshan Golnari, Zhi-Li Zhang","submitted_at":"2018-06-16T04:50:48Z","abstract_excerpt":"When a network is prone to failures, it is very expensive to compute the shortest paths every time from the scratch. Distance sensitivity oracle provides this privilege to find the new shortest paths faster and with lower cost by once pre-computing an oracle in advance. Although several efficient solutions are proposed in the literature to support the single failure, few efforts are done to devise an efficient method regarding the case of multiple failures. In this paper, we present a novel distance sensitivity oracle based on Markov Tensor Theory \\cite{golnari2017markov} to support replacemen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06182","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":""},"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-05-18T00:13:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaLjAwRqij1EBgJAImxkk0FTYQsWgwju8Su44IYc5c3jvFWjoiNoO3wVgB2g6tisMU5EwhgIB9CLt6p9lmQ9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:13:54.436280Z"},"content_sha256":"db65d016d3dc38e066dd2400211c73a06dd11142384eb10e85f60303a46fc3d6","schema_version":"1.0","event_id":"sha256:db65d016d3dc38e066dd2400211c73a06dd11142384eb10e85f60303a46fc3d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMJYMECVVFTPLCHWSY6Q2NL6ZL/bundle.json","state_url":"https://pith.science/pith/KMJYMECVVFTPLCHWSY6Q2NL6ZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMJYMECVVFTPLCHWSY6Q2NL6ZL/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-05-31T03:13:54Z","links":{"resolver":"https://pith.science/pith/KMJYMECVVFTPLCHWSY6Q2NL6ZL","bundle":"https://pith.science/pith/KMJYMECVVFTPLCHWSY6Q2NL6ZL/bundle.json","state":"https://pith.science/pith/KMJYMECVVFTPLCHWSY6Q2NL6ZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMJYMECVVFTPLCHWSY6Q2NL6ZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KMJYMECVVFTPLCHWSY6Q2NL6ZL","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":"e516858a85b3dd3de9552b0fdc5bfdce56a33a422a6351e51986c6a82156ba33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-16T04:50:48Z","title_canon_sha256":"1b3fa3aace0fa47b8c55995130a67963f8f4d058bdf4ef8044a91733df9b0824"},"schema_version":"1.0","source":{"id":"1806.06182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06182","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06182v1","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06182","created_at":"2026-05-18T00:13:03Z"},{"alias_kind":"pith_short_12","alias_value":"KMJYMECVVFTP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KMJYMECVVFTPLCHW","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KMJYMECV","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:db65d016d3dc38e066dd2400211c73a06dd11142384eb10e85f60303a46fc3d6","target":"graph","created_at":"2026-05-18T00:13: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"},"paper":{"abstract_excerpt":"When a network is prone to failures, it is very expensive to compute the shortest paths every time from the scratch. Distance sensitivity oracle provides this privilege to find the new shortest paths faster and with lower cost by once pre-computing an oracle in advance. Although several efficient solutions are proposed in the literature to support the single failure, few efforts are done to devise an efficient method regarding the case of multiple failures. In this paper, we present a novel distance sensitivity oracle based on Markov Tensor Theory \\cite{golnari2017markov} to support replacemen","authors_text":"Golshan Golnari, Zhi-Li Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-16T04:50:48Z","title":"Fast Distance Sensitivity Oracle for Multiple Failures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06182","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:2bc07a465148f56038d7ccc0d20f42de84255a41d0c1880b669b8c6084bb7196","target":"record","created_at":"2026-05-18T00:13: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":"e516858a85b3dd3de9552b0fdc5bfdce56a33a422a6351e51986c6a82156ba33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-16T04:50:48Z","title_canon_sha256":"1b3fa3aace0fa47b8c55995130a67963f8f4d058bdf4ef8044a91733df9b0824"},"schema_version":"1.0","source":{"id":"1806.06182","kind":"arxiv","version":1}},"canonical_sha256":"5313861055a966f588f6963d0d357ecaf85aa2ef3b90c07771f3ea62a8c35e24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5313861055a966f588f6963d0d357ecaf85aa2ef3b90c07771f3ea62a8c35e24","first_computed_at":"2026-05-18T00:13:03.403268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:03.403268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EJLRoNh5rJiYWqibGtMs51OgORVua+ievD2l7Xe7Y1MdJBibja34FS5+7lFNgNZqIJAkDDHT1msUkO38OPKqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:03.403924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bc07a465148f56038d7ccc0d20f42de84255a41d0c1880b669b8c6084bb7196","sha256:db65d016d3dc38e066dd2400211c73a06dd11142384eb10e85f60303a46fc3d6"],"state_sha256":"fdd2b3c49899ac2115fd8b7eb77f817f53f607df520fd9f051bfb4ab6f5e86ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrSYFyqpH6DMoJx+r/o+kvUPHRN5bnvBOZtnwjCCIagyZYznHsgZuF9uEUVBKoWVfgUql/vvLeZZyHUp6wUwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:13:54.438966Z","bundle_sha256":"6d64762acff5856677f7e47894ddc5805e14a7baf619a7541e47eb6cda1feafc"}}