{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:M5RO76JSZLAQSBOYEZJFDESIVE","short_pith_number":"pith:M5RO76JS","canonical_record":{"source":{"id":"2211.02681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-02T05:15:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8c3afe832f349db0664fa152323848d2e38c2abc887f77bb7d44e0b0f97eaa82","abstract_canon_sha256":"cee71cac44e87af820c59aef163e5f4ea9e66657ac135c63d6803d8506f64e6a"},"schema_version":"1.0"},"canonical_sha256":"6762eff932cac10905d82652519248a92b8d6dc82e33eb82130da0b6523e2eea","source":{"kind":"arxiv","id":"2211.02681","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02681","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02681v2","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02681","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_12","alias_value":"M5RO76JSZLAQ","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_16","alias_value":"M5RO76JSZLAQSBOY","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_8","alias_value":"M5RO76JS","created_at":"2026-07-05T07:01:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:M5RO76JSZLAQSBOYEZJFDESIVE","target":"record","payload":{"canonical_record":{"source":{"id":"2211.02681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-02T05:15:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8c3afe832f349db0664fa152323848d2e38c2abc887f77bb7d44e0b0f97eaa82","abstract_canon_sha256":"cee71cac44e87af820c59aef163e5f4ea9e66657ac135c63d6803d8506f64e6a"},"schema_version":"1.0"},"canonical_sha256":"6762eff932cac10905d82652519248a92b8d6dc82e33eb82130da0b6523e2eea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:01:57.742876Z","signature_b64":"byCxk4pSYLfW0ZnZrA3c7muo2Do4StSA5DoJ8TuoaWzw5C9Vfdtog1lTix0bA1rn3L7MPO6Qx0/6S1zqDclyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6762eff932cac10905d82652519248a92b8d6dc82e33eb82130da0b6523e2eea","last_reissued_at":"2026-07-05T07:01:57.742294Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:01:57.742294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.02681","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-05T07:01:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKJuczGsZ6AbV/zP6NvqF2Ny1gyAvTpaJ6GRzXyvZk5h/YlUiEp14NaXip+lFMCcZNgQlvG8mEYC1R01uykpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:02:58.688236Z"},"content_sha256":"f8e907867978a33317daf021fa90be92f59bb66f9c18e0415f205bd79e4e20e7","schema_version":"1.0","event_id":"sha256:f8e907867978a33317daf021fa90be92f59bb66f9c18e0415f205bd79e4e20e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:M5RO76JSZLAQSBOYEZJFDESIVE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Distance Sensitivity Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Allison Gunby-Mann, Arnav Bhakta, Chau Pham, Davin Jeong, Maximilian Katzmann, Sang Chin, Sarel Cohen, Tobias Friedrich","submitted_at":"2022-11-02T05:15:48Z","abstract_excerpt":"One of the most fundamental graph problems is finding a shortest path from a source to a target node. While in its basic forms the problem has been studied extensively and efficient algorithms are known, it becomes significantly harder as soon as parts of the graph are susceptible to failure. Although one can recompute a shortest replacement path after every outage, this is rather inefficient both in time and/or storage. One way to overcome this problem is to shift computational burden from the queries into a pre-processing step, where a data structure is computed that allows for fast querying"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02681","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/2211.02681/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-05T07:01:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/NQH1Z3Vddympt6VhlJB697wi+HFgx5q08vdvwoa6a0R05zc8xIFrBmU2K/sQvwzEIaNcKPhmQ8KFZ9TVxPRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:02:58.692899Z"},"content_sha256":"d9c7e0bc6fd46d646cf10bebc31ae0efb5ffa467390d2281614215359486b0f6","schema_version":"1.0","event_id":"sha256:d9c7e0bc6fd46d646cf10bebc31ae0efb5ffa467390d2281614215359486b0f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5RO76JSZLAQSBOYEZJFDESIVE/bundle.json","state_url":"https://pith.science/pith/M5RO76JSZLAQSBOYEZJFDESIVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5RO76JSZLAQSBOYEZJFDESIVE/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-10T17:02:58Z","links":{"resolver":"https://pith.science/pith/M5RO76JSZLAQSBOYEZJFDESIVE","bundle":"https://pith.science/pith/M5RO76JSZLAQSBOYEZJFDESIVE/bundle.json","state":"https://pith.science/pith/M5RO76JSZLAQSBOYEZJFDESIVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5RO76JSZLAQSBOYEZJFDESIVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:M5RO76JSZLAQSBOYEZJFDESIVE","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":"cee71cac44e87af820c59aef163e5f4ea9e66657ac135c63d6803d8506f64e6a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-02T05:15:48Z","title_canon_sha256":"8c3afe832f349db0664fa152323848d2e38c2abc887f77bb7d44e0b0f97eaa82"},"schema_version":"1.0","source":{"id":"2211.02681","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02681","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02681v2","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02681","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_12","alias_value":"M5RO76JSZLAQ","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_16","alias_value":"M5RO76JSZLAQSBOY","created_at":"2026-07-05T07:01:57Z"},{"alias_kind":"pith_short_8","alias_value":"M5RO76JS","created_at":"2026-07-05T07:01:57Z"}],"graph_snapshots":[{"event_id":"sha256:d9c7e0bc6fd46d646cf10bebc31ae0efb5ffa467390d2281614215359486b0f6","target":"graph","created_at":"2026-07-05T07:01:57Z","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/2211.02681/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the most fundamental graph problems is finding a shortest path from a source to a target node. While in its basic forms the problem has been studied extensively and efficient algorithms are known, it becomes significantly harder as soon as parts of the graph are susceptible to failure. Although one can recompute a shortest replacement path after every outage, this is rather inefficient both in time and/or storage. One way to overcome this problem is to shift computational burden from the queries into a pre-processing step, where a data structure is computed that allows for fast querying","authors_text":"Allison Gunby-Mann, Arnav Bhakta, Chau Pham, Davin Jeong, Maximilian Katzmann, Sang Chin, Sarel Cohen, Tobias Friedrich","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-02T05:15:48Z","title":"Deep Distance Sensitivity Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02681","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:f8e907867978a33317daf021fa90be92f59bb66f9c18e0415f205bd79e4e20e7","target":"record","created_at":"2026-07-05T07:01:57Z","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":"cee71cac44e87af820c59aef163e5f4ea9e66657ac135c63d6803d8506f64e6a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-02T05:15:48Z","title_canon_sha256":"8c3afe832f349db0664fa152323848d2e38c2abc887f77bb7d44e0b0f97eaa82"},"schema_version":"1.0","source":{"id":"2211.02681","kind":"arxiv","version":2}},"canonical_sha256":"6762eff932cac10905d82652519248a92b8d6dc82e33eb82130da0b6523e2eea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6762eff932cac10905d82652519248a92b8d6dc82e33eb82130da0b6523e2eea","first_computed_at":"2026-07-05T07:01:57.742294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:01:57.742294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"byCxk4pSYLfW0ZnZrA3c7muo2Do4StSA5DoJ8TuoaWzw5C9Vfdtog1lTix0bA1rn3L7MPO6Qx0/6S1zqDclyCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:01:57.742876Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.02681","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8e907867978a33317daf021fa90be92f59bb66f9c18e0415f205bd79e4e20e7","sha256:d9c7e0bc6fd46d646cf10bebc31ae0efb5ffa467390d2281614215359486b0f6"],"state_sha256":"fd339c77d1363838e6a0f0b2527bf8c3b6b337631aa537147e6f288ae2f3329b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hoRElNUx5ydqva3a0ngEbBS1pdk9B4uP0gW02EhHJq9L4XZ0hH/82WV+kRs8DXOjjqnsC8TDcrZyT6/C5OCiDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T17:02:58.706110Z","bundle_sha256":"95aa45ac24cec44097a98614b321f6c1ca3adb44b6a66c39cdddb29b59a61b86"}}