{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LAU5RG6EOFX7G2EJ7TGY7AHEJU","short_pith_number":"pith:LAU5RG6E","canonical_record":{"source":{"id":"1908.06798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T13:44:57Z","cross_cats_sorted":[],"title_canon_sha256":"6da8bfca15b84973f57324d3910bcd8a217472f1415ae1bacaaf9fa410ad1e38","abstract_canon_sha256":"08ce314fe7a77db88646de25d5bb033f9281b2a855514a4732bdac6c8db06ddd"},"schema_version":"1.0"},"canonical_sha256":"5829d89bc4716ff36889fccd8f80e44d0e402e671b28885af7d836669695a955","source":{"kind":"arxiv","id":"1908.06798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06798","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06798v1","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06798","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"LAU5RG6EOFX7","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_16","alias_value":"LAU5RG6EOFX7G2EJ","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_8","alias_value":"LAU5RG6E","created_at":"2026-07-04T23:58:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LAU5RG6EOFX7G2EJ7TGY7AHEJU","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T13:44:57Z","cross_cats_sorted":[],"title_canon_sha256":"6da8bfca15b84973f57324d3910bcd8a217472f1415ae1bacaaf9fa410ad1e38","abstract_canon_sha256":"08ce314fe7a77db88646de25d5bb033f9281b2a855514a4732bdac6c8db06ddd"},"schema_version":"1.0"},"canonical_sha256":"5829d89bc4716ff36889fccd8f80e44d0e402e671b28885af7d836669695a955","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:19.461963Z","signature_b64":"N1qn4xkjdAyfWmlNH4kvsEnRo3xIGJSgwusGaZsSJ74utW0j0WMDmXg/XDvLl9TQbz2MPOvQVZl/N4NfdwWHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5829d89bc4716ff36889fccd8f80e44d0e402e671b28885af7d836669695a955","last_reissued_at":"2026-07-04T23:58:19.461575Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:19.461575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06798","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":"/TE5ASrnRuv+uHSatYsiq4tsuXnQoTDSrgcPCV/PgLb/Anbynvs91fge4dQrgnCCYIAX+Z9lP4PbJXHjrG43Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:10:23.761335Z"},"content_sha256":"cefa02d5e348f67d4c9b56d027b6a40509b266620eb1808c940c49417c842afb","schema_version":"1.0","event_id":"sha256:cefa02d5e348f67d4c9b56d027b6a40509b266620eb1808c940c49417c842afb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LAU5RG6EOFX7G2EJ7TGY7AHEJU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Fast Weighted 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:44:57Z","abstract_excerpt":"Recently we submitted a paper, whose title is A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees, to arXiv. This is related to unweighted graphs. This paper also presents a new fast all-pairs shortest path algorithm for weighted graph based on the same idea. In Dijkstra algorithm which is said to be fast in weighted 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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06798","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.06798/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":"w572nIJGuppkDBrBSYxo4fvhfSfYgTNXgmzw6Eb+ove0v7MeZbISDxH1C+/buxR3HaLCgmA3UMGzhHoK5bX3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:10:23.762025Z"},"content_sha256":"d1150fb677d24581b074ab96f83db3581985d2419e67e8442a1c5baffac4f18f","schema_version":"1.0","event_id":"sha256:d1150fb677d24581b074ab96f83db3581985d2419e67e8442a1c5baffac4f18f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAU5RG6EOFX7G2EJ7TGY7AHEJU/bundle.json","state_url":"https://pith.science/pith/LAU5RG6EOFX7G2EJ7TGY7AHEJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAU5RG6EOFX7G2EJ7TGY7AHEJU/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-16T09:10:23Z","links":{"resolver":"https://pith.science/pith/LAU5RG6EOFX7G2EJ7TGY7AHEJU","bundle":"https://pith.science/pith/LAU5RG6EOFX7G2EJ7TGY7AHEJU/bundle.json","state":"https://pith.science/pith/LAU5RG6EOFX7G2EJ7TGY7AHEJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAU5RG6EOFX7G2EJ7TGY7AHEJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LAU5RG6EOFX7G2EJ7TGY7AHEJU","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":"08ce314fe7a77db88646de25d5bb033f9281b2a855514a4732bdac6c8db06ddd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T13:44:57Z","title_canon_sha256":"6da8bfca15b84973f57324d3910bcd8a217472f1415ae1bacaaf9fa410ad1e38"},"schema_version":"1.0","source":{"id":"1908.06798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06798","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06798v1","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06798","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"LAU5RG6EOFX7","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_16","alias_value":"LAU5RG6EOFX7G2EJ","created_at":"2026-07-04T23:58:19Z"},{"alias_kind":"pith_short_8","alias_value":"LAU5RG6E","created_at":"2026-07-04T23:58:19Z"}],"graph_snapshots":[{"event_id":"sha256:d1150fb677d24581b074ab96f83db3581985d2419e67e8442a1c5baffac4f18f","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.06798/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently we submitted a paper, whose title is A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees, to arXiv. This is related to unweighted graphs. This paper also presents a new fast all-pairs shortest path algorithm for weighted graph based on the same idea. In Dijkstra algorithm which is said to be fast in weighted 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 ","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:44:57Z","title":"A New Fast Weighted 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.06798","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:cefa02d5e348f67d4c9b56d027b6a40509b266620eb1808c940c49417c842afb","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":"08ce314fe7a77db88646de25d5bb033f9281b2a855514a4732bdac6c8db06ddd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T13:44:57Z","title_canon_sha256":"6da8bfca15b84973f57324d3910bcd8a217472f1415ae1bacaaf9fa410ad1e38"},"schema_version":"1.0","source":{"id":"1908.06798","kind":"arxiv","version":1}},"canonical_sha256":"5829d89bc4716ff36889fccd8f80e44d0e402e671b28885af7d836669695a955","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5829d89bc4716ff36889fccd8f80e44d0e402e671b28885af7d836669695a955","first_computed_at":"2026-07-04T23:58:19.461575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:19.461575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N1qn4xkjdAyfWmlNH4kvsEnRo3xIGJSgwusGaZsSJ74utW0j0WMDmXg/XDvLl9TQbz2MPOvQVZl/N4NfdwWHCw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:19.461963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cefa02d5e348f67d4c9b56d027b6a40509b266620eb1808c940c49417c842afb","sha256:d1150fb677d24581b074ab96f83db3581985d2419e67e8442a1c5baffac4f18f"],"state_sha256":"29dbb86bdcaeb02c9cc4078d282d9e91ac254a3370867f0c43cce3953ed429ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"puqLKtL1LKSz74tWFm417x+fLHPBt3he7pvO8cigtyNPbQeGzBZRvii8u7CU/i/PvcOYbesJWdL4+6XL9sDbCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T09:10:23.766963Z","bundle_sha256":"9f1d363093a0296a628c7207ce6241697336f6ca19418b85ab50cfe6951e6908"}}