{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BVLR74A7FZ6NLUXOXSJ3DDNYDY","short_pith_number":"pith:BVLR74A7","schema_version":"1.0","canonical_sha256":"0d571ff01f2e7cd5d2eebc93b18db81e1c64aaf7d66597677a106cbf4f9efc71","source":{"kind":"arxiv","id":"1908.06806","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.06806","created_at":"2026-07-04T23:58:19.549620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06806v1","created_at":"2026-07-04T23:58:19.549620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06806","created_at":"2026-07-04T23:58:19.549620+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVLR74A7FZ6N","created_at":"2026-07-04T23:58:19.549620+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVLR74A7FZ6NLUXO","created_at":"2026-07-04T23:58:19.549620+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVLR74A7","created_at":"2026-07-04T23:58:19.549620+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/BVLR74A7FZ6NLUXOXSJ3DDNYDY","json":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY.json","graph_json":"https://pith.science/api/pith-number/BVLR74A7FZ6NLUXOXSJ3DDNYDY/graph.json","events_json":"https://pith.science/api/pith-number/BVLR74A7FZ6NLUXOXSJ3DDNYDY/events.json","paper":"https://pith.science/paper/BVLR74A7"},"agent_actions":{"view_html":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY","download_json":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY.json","view_paper":"https://pith.science/paper/BVLR74A7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06806&json=true","fetch_graph":"https://pith.science/api/pith-number/BVLR74A7FZ6NLUXOXSJ3DDNYDY/graph.json","fetch_events":"https://pith.science/api/pith-number/BVLR74A7FZ6NLUXOXSJ3DDNYDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/action/storage_attestation","attest_author":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/action/author_attestation","sign_citation":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/action/citation_signature","submit_replication":"https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY/action/replication_record"}},"created_at":"2026-07-04T23:58:19.549620+00:00","updated_at":"2026-07-04T23:58:19.549620+00:00"}