{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G6BUQWDW2KDARJ6VEAZZVKMPUH","short_pith_number":"pith:G6BUQWDW","canonical_record":{"source":{"id":"1511.07100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T02:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"d4e3465390a5414967d9d94f5b8c4aa633a5873468903836075080dd9a5b7608","abstract_canon_sha256":"ddb5ffcdfd60ed5755c22fac31fb3e047223c9a62e6047cac67a9f41db9356a5"},"schema_version":"1.0"},"canonical_sha256":"3783485876d28608a7d520339aa98fa1ea7d54343815a1eb3312f432145491fe","source":{"kind":"arxiv","id":"1511.07100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07100","created_at":"2026-05-18T01:26:16Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07100v1","created_at":"2026-05-18T01:26:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07100","created_at":"2026-05-18T01:26:16Z"},{"alias_kind":"pith_short_12","alias_value":"G6BUQWDW2KDA","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G6BUQWDW2KDARJ6V","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G6BUQWDW","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G6BUQWDW2KDARJ6VEAZZVKMPUH","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T02:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"d4e3465390a5414967d9d94f5b8c4aa633a5873468903836075080dd9a5b7608","abstract_canon_sha256":"ddb5ffcdfd60ed5755c22fac31fb3e047223c9a62e6047cac67a9f41db9356a5"},"schema_version":"1.0"},"canonical_sha256":"3783485876d28608a7d520339aa98fa1ea7d54343815a1eb3312f432145491fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:16.674368Z","signature_b64":"/oWo6XlfECy4gIgHge6m6X5kphItstlz9o/62kWvCf3aU9JsvQcGNDw0aMjCcYVZ8EDkVw1BwQSnrj40ZjClBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3783485876d28608a7d520339aa98fa1ea7d54343815a1eb3312f432145491fe","last_reissued_at":"2026-05-18T01:26:16.673876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:16.673876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07100","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-18T01:26:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xPEMja97IyfO3wqTTso+UXzRSR3XsLMVg/wL0MRR2XxG6Jo727DkW0gbucxS7nnaT+DvKTdyb2Z9caTbvgSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:35:24.210263Z"},"content_sha256":"0513dcb83fa9f5044e9b254cc3812c53b4557a7e9f680c393c4d06689027358a","schema_version":"1.0","event_id":"sha256:0513dcb83fa9f5044e9b254cc3812c53b4557a7e9f680c393c4d06689027358a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G6BUQWDW2KDARJ6VEAZZVKMPUH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A reduction of the logspace shortest path problem to biconnected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Boris Brimkov","submitted_at":"2015-11-23T02:55:46Z","abstract_excerpt":"In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest path algorithm for general graphs which uses a logspace shortest path oracle for biconnected graphs. We also present a linear time logspace shortest path algorithm for graphs with bounded vertex degree and biconnected component size, which does not rely on an oracle. The asymptotic time-space product of this algorithm is the best possible among all shortest path algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07100","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-18T01:26:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pScW+Pw5iv4HDpB17V8z/+MP8wYtnKpvlBFZD/zns9UGBBgobxVE2+NWt+VmD1+3gAbI67129xbf89fiLO6dBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:35:24.210630Z"},"content_sha256":"00798f325c94236327b5ba131f41eef338e5201e54a78b739ea4226239270e56","schema_version":"1.0","event_id":"sha256:00798f325c94236327b5ba131f41eef338e5201e54a78b739ea4226239270e56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6BUQWDW2KDARJ6VEAZZVKMPUH/bundle.json","state_url":"https://pith.science/pith/G6BUQWDW2KDARJ6VEAZZVKMPUH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6BUQWDW2KDARJ6VEAZZVKMPUH/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-30T13:35:24Z","links":{"resolver":"https://pith.science/pith/G6BUQWDW2KDARJ6VEAZZVKMPUH","bundle":"https://pith.science/pith/G6BUQWDW2KDARJ6VEAZZVKMPUH/bundle.json","state":"https://pith.science/pith/G6BUQWDW2KDARJ6VEAZZVKMPUH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6BUQWDW2KDARJ6VEAZZVKMPUH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G6BUQWDW2KDARJ6VEAZZVKMPUH","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":"ddb5ffcdfd60ed5755c22fac31fb3e047223c9a62e6047cac67a9f41db9356a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T02:55:46Z","title_canon_sha256":"d4e3465390a5414967d9d94f5b8c4aa633a5873468903836075080dd9a5b7608"},"schema_version":"1.0","source":{"id":"1511.07100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07100","created_at":"2026-05-18T01:26:16Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07100v1","created_at":"2026-05-18T01:26:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07100","created_at":"2026-05-18T01:26:16Z"},{"alias_kind":"pith_short_12","alias_value":"G6BUQWDW2KDA","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G6BUQWDW2KDARJ6V","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G6BUQWDW","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:00798f325c94236327b5ba131f41eef338e5201e54a78b739ea4226239270e56","target":"graph","created_at":"2026-05-18T01:26:16Z","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":"In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest path algorithm for general graphs which uses a logspace shortest path oracle for biconnected graphs. We also present a linear time logspace shortest path algorithm for graphs with bounded vertex degree and biconnected component size, which does not rely on an oracle. The asymptotic time-space product of this algorithm is the best possible among all shortest path algorithms.","authors_text":"Boris Brimkov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T02:55:46Z","title":"A reduction of the logspace shortest path problem to biconnected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07100","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:0513dcb83fa9f5044e9b254cc3812c53b4557a7e9f680c393c4d06689027358a","target":"record","created_at":"2026-05-18T01:26:16Z","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":"ddb5ffcdfd60ed5755c22fac31fb3e047223c9a62e6047cac67a9f41db9356a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-23T02:55:46Z","title_canon_sha256":"d4e3465390a5414967d9d94f5b8c4aa633a5873468903836075080dd9a5b7608"},"schema_version":"1.0","source":{"id":"1511.07100","kind":"arxiv","version":1}},"canonical_sha256":"3783485876d28608a7d520339aa98fa1ea7d54343815a1eb3312f432145491fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3783485876d28608a7d520339aa98fa1ea7d54343815a1eb3312f432145491fe","first_computed_at":"2026-05-18T01:26:16.673876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:16.673876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/oWo6XlfECy4gIgHge6m6X5kphItstlz9o/62kWvCf3aU9JsvQcGNDw0aMjCcYVZ8EDkVw1BwQSnrj40ZjClBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:16.674368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0513dcb83fa9f5044e9b254cc3812c53b4557a7e9f680c393c4d06689027358a","sha256:00798f325c94236327b5ba131f41eef338e5201e54a78b739ea4226239270e56"],"state_sha256":"78e9ccaf4eb206b45f7e5b4becc355810f598445fa1864d4f267e890d14340b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8YTPs+B4xjEJfytZbCT1/Ltt0NSOMpy/4UMigiDphOofqljFN+zgGeLbR4lRoHpVc8gsxH90fcLyrWAiRKPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:35:24.212667Z","bundle_sha256":"55ac8666e16177d8121379e03769d9919d4b29a56b80c38a23b4eaa506bc7ecf"}}