{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TPQW2GNRIOMBLQ5YIBTBU62TCY","short_pith_number":"pith:TPQW2GNR","schema_version":"1.0","canonical_sha256":"9be16d19b1439815c3b840661a7b531613725f74d4e0fee142db013ef515f5e3","source":{"kind":"arxiv","id":"1605.04491","version":1},"attestation_state":"computed","paper":{"title":"Improved distance sensitivity oracles via tree partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ran Duan, Tianyi Zhang","submitted_at":"2016-05-15T02:16:05Z","abstract_excerpt":"We introduce an improved structure of distance sensitivity oracle (DSO). The task is to pre-process a non-negatively weighted graph so that a data structure can quickly answer replacement path length for every triple of source, terminal and failed vertex. The previous best algorithm constructs in time $\\tilde{O}(mn)$ a distance sensitivity oracle of size $O(n^2\\log n)$ that processes queries in $O(1)$ time. As an improvement, our oracle takes up $O(n^2)$ space, while preserving $O(1)$ query efficiency and $\\tilde{O}(mn)$ preprocessing time. One should notice that space complexity and query tim"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1605.04491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-15T02:16:05Z","cross_cats_sorted":[],"title_canon_sha256":"c1b1365d0d02ce02fc70093d5e6f77d0d0bbc88168a8a1438f78125c0b73e710","abstract_canon_sha256":"582297898ab82802a49c817e2f0acacf97e33a40f562fc861d635adfe3606436"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:47.071520Z","signature_b64":"LbVAfchPUQzuwaiNqH10jC6LJLuohTg/4WnvivYsXaw0pgePAQByYbwZ0iylWmkDz9GL2MyP+HTBq9awyVnxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9be16d19b1439815c3b840661a7b531613725f74d4e0fee142db013ef515f5e3","last_reissued_at":"2026-05-18T01:14:47.070772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:47.070772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved distance sensitivity oracles via tree partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ran Duan, Tianyi Zhang","submitted_at":"2016-05-15T02:16:05Z","abstract_excerpt":"We introduce an improved structure of distance sensitivity oracle (DSO). The task is to pre-process a non-negatively weighted graph so that a data structure can quickly answer replacement path length for every triple of source, terminal and failed vertex. The previous best algorithm constructs in time $\\tilde{O}(mn)$ a distance sensitivity oracle of size $O(n^2\\log n)$ that processes queries in $O(1)$ time. As an improvement, our oracle takes up $O(n^2)$ space, while preserving $O(1)$ query efficiency and $\\tilde{O}(mn)$ preprocessing time. One should notice that space complexity and query tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04491","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.04491","created_at":"2026-05-18T01:14:47.070887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04491v1","created_at":"2026-05-18T01:14:47.070887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04491","created_at":"2026-05-18T01:14:47.070887+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPQW2GNRIOMB","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPQW2GNRIOMBLQ5Y","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPQW2GNR","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPQW2GNRIOMBLQ5YIBTBU62TCY","json":"https://pith.science/pith/TPQW2GNRIOMBLQ5YIBTBU62TCY.json","graph_json":"https://pith.science/api/pith-number/TPQW2GNRIOMBLQ5YIBTBU62TCY/graph.json","events_json":"https://pith.science/api/pith-number/TPQW2GNRIOMBLQ5YIBTBU62TCY/events.json","paper":"https://pith.science/paper/TPQW2GNR"},"agent_actions":{"view_html":"https://pith.science/pith/TPQW2GNRIOMBLQ5YIBTBU62TCY","download_json":"https://pith.science/pith/TPQW2GNRIOMBLQ5YIBTBU62TCY.json","view_paper":"https://pith.science/paper/TPQW2GNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04491&json=true","fetch_graph":"https://pith.science/api/pith-number/TPQW2GNRIOMBLQ5YIBTBU62TCY/graph.json","fetch_events":"https://pith.science/api/pith-number/TPQW2GNRIOMBLQ5YIBTBU62TCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPQW2GNRIOMBLQ5YIBTBU62TCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPQW2GNRIOMBLQ5YIBTBU62TCY/action/storage_attestation","attest_author":"https://pith.science/pith/TPQW2GNRIOMBLQ5YIBTBU62TCY/action/author_attestation","sign_citation":"https://pith.science/pith/TPQW2GNRIOMBLQ5YIBTBU62TCY/action/citation_signature","submit_replication":"https://pith.science/pith/TPQW2GNRIOMBLQ5YIBTBU62TCY/action/replication_record"}},"created_at":"2026-05-18T01:14:47.070887+00:00","updated_at":"2026-05-18T01:14:47.070887+00:00"}