{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BVLR74A7FZ6NLUXOXSJ3DDNYDY","short_pith_number":"pith:BVLR74A7","canonical_record":{"source":{"id":"1908.06806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T13:55:35Z","cross_cats_sorted":[],"title_canon_sha256":"04a740d950ec7ea93f97d1070e5c45b90276b985e74b995d014e6ba0d6a72b01","abstract_canon_sha256":"d4c394b55f545656986f5650931aae67dff29410e5f6650426c1d00ba25f60c1"},"schema_version":"1.0"},"canonical_sha256":"0d571ff01f2e7cd5d2eebc93b18db81e1c64aaf7d66597677a106cbf4f9efc71","source":{"kind":"arxiv","id":"1908.06806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06806","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06806v1","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06806","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"BVLR74A7FZ6N","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_16","alias_value":"BVLR74A7FZ6NLUXO","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_8","alias_value":"BVLR74A7","created_at":"2026-07-04T23:58:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BVLR74A7FZ6NLUXOXSJ3DDNYDY","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T13:55:35Z","cross_cats_sorted":[],"title_canon_sha256":"04a740d950ec7ea93f97d1070e5c45b90276b985e74b995d014e6ba0d6a72b01","abstract_canon_sha256":"d4c394b55f545656986f5650931aae67dff29410e5f6650426c1d00ba25f60c1"},"schema_version":"1.0"},"canonical_sha256":"0d571ff01f2e7cd5d2eebc93b18db81e1c64aaf7d66597677a106cbf4f9efc71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:19.549892Z","signature_b64":"B0Uh4AGhcsGhZW6YY66ggHLd4TEBQ9N4/9neiDd39uL+2KV5REhfBniKZ/QUjkeSp046MA+zHzxZSS3HjzshAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d571ff01f2e7cd5d2eebc93b18db81e1c64aaf7d66597677a106cbf4f9efc71","last_reissued_at":"2026-07-04T23:58:19.549567Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:19.549567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06806","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-07-04T23:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8f306rgGU9up6K8zNdR0dk7jDQl+OZHkS29SD613rjgMsitpG1pjgEhPJUVnMKWPLoIh21KMCjgRWW3NfsR0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:16:49.723524Z"},"content_sha256":"93663dece47af53d48b1080bb8adf4410dfb45eb9d9f2a6e1cda8855c98e77b4","schema_version":"1.0","event_id":"sha256:93663dece47af53d48b1080bb8adf4410dfb45eb9d9f2a6e1cda8855c98e77b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BVLR74A7FZ6NLUXOXSJ3DDNYDY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kenichi Kobayashi, Yasuo Yamane","submitted_at":"2019-08-19T13:55:35Z","abstract_excerpt":"We present a new fast all-pairs shortest path algorithm for unweighted graphs. In breadth-first search which is said to representative and fast in unweighted graphs, the average number of accesses to adjacent vertices (expressed by {\\alpha}) is about equal to the average degree of the graph. On the other hand, our algorithm utilizes the shortest path trees of adjacent vertices of each source vertex, and reduce {\\alpha} drastically. Roughly speaking {\\alpha} is reduced to the value close to 1, because the average degree of a tree is about 2, and one is used to come in and the other is used to g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06806","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06806/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-04T23:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7wgerIBHZQGe/DuUMagalshVIr6mOXwK3xxe0rh8E/bWJMPaK0x8r/kDoPmYkneZlFsTmKHOqj7kkwKmt9DJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T19:16:49.724060Z"},"content_sha256":"2bc69aa2e137a99537ed5e1ed6e1ae5f58905111fd93be06c1ce2ed5aa5c77d0","schema_version":"1.0","event_id":"sha256:2bc69aa2e137a99537ed5e1ed6e1ae5f58905111fd93be06c1ce2ed5aa5c77d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/bundle.json","state_url":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/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-16T19:16:49Z","links":{"resolver":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY","bundle":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/bundle.json","state":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BVLR74A7FZ6NLUXOXSJ3DDNYDY","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":"d4c394b55f545656986f5650931aae67dff29410e5f6650426c1d00ba25f60c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T13:55:35Z","title_canon_sha256":"04a740d950ec7ea93f97d1070e5c45b90276b985e74b995d014e6ba0d6a72b01"},"schema_version":"1.0","source":{"id":"1908.06806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06806","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06806v1","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06806","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"BVLR74A7FZ6N","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_16","alias_value":"BVLR74A7FZ6NLUXO","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_8","alias_value":"BVLR74A7","created_at":"2026-07-04T23:58:19Z"}],"graph_snapshots":[{"event_id":"sha256:2bc69aa2e137a99537ed5e1ed6e1ae5f58905111fd93be06c1ce2ed5aa5c77d0","target":"graph","created_at":"2026-07-04T23:58:19Z","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/1908.06806/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new fast all-pairs shortest path algorithm for unweighted graphs. In breadth-first search which is said to representative and fast in unweighted graphs, the average number of accesses to adjacent vertices (expressed by {\\alpha}) is about equal to the average degree of the graph. On the other hand, our algorithm utilizes the shortest path trees of adjacent vertices of each source vertex, and reduce {\\alpha} drastically. Roughly speaking {\\alpha} is reduced to the value close to 1, because the average degree of a tree is about 2, and one is used to come in and the other is used to g","authors_text":"Kenichi Kobayashi, Yasuo Yamane","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T13:55:35Z","title":"A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06806","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:93663dece47af53d48b1080bb8adf4410dfb45eb9d9f2a6e1cda8855c98e77b4","target":"record","created_at":"2026-07-04T23:58:19Z","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":"d4c394b55f545656986f5650931aae67dff29410e5f6650426c1d00ba25f60c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T13:55:35Z","title_canon_sha256":"04a740d950ec7ea93f97d1070e5c45b90276b985e74b995d014e6ba0d6a72b01"},"schema_version":"1.0","source":{"id":"1908.06806","kind":"arxiv","version":1}},"canonical_sha256":"0d571ff01f2e7cd5d2eebc93b18db81e1c64aaf7d66597677a106cbf4f9efc71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d571ff01f2e7cd5d2eebc93b18db81e1c64aaf7d66597677a106cbf4f9efc71","first_computed_at":"2026-07-04T23:58:19.549567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:19.549567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B0Uh4AGhcsGhZW6YY66ggHLd4TEBQ9N4/9neiDd39uL+2KV5REhfBniKZ/QUjkeSp046MA+zHzxZSS3HjzshAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:19.549892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93663dece47af53d48b1080bb8adf4410dfb45eb9d9f2a6e1cda8855c98e77b4","sha256:2bc69aa2e137a99537ed5e1ed6e1ae5f58905111fd93be06c1ce2ed5aa5c77d0"],"state_sha256":"7da93f4a4b2721cc8fa55f3563999cff3e239f206bbd86fbcb377ae760b5af33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Hn0ALGmtEQDq58jG9ym8MauvQH+BOxwdBVs3XnuIRQHpT+pL1NAlXEBwRdfD/dfgXq/sucS6p/t22lY+QeoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T19:16:49.727623Z","bundle_sha256":"c8fe513e7262047e02698f5e4a1e41b0f296105f45c6107b736307d129068994"}}