{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TEDLXHNC6YKX77ZY5BZCCBGSUS","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":"104715eb506b3a7c888e4a39bfbb48b69a3a656c530079660987aec4f8dea209","cross_cats_sorted":["q-bio.NC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-06T05:43:24Z","title_canon_sha256":"e4c2c4f3945a820a93b55fd279744e3b67b54d9fc965c57603b065eebff33a86"},"schema_version":"1.0","source":{"id":"2308.07403","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07403","created_at":"2026-07-05T08:47:46Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07403v2","created_at":"2026-07-05T08:47:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07403","created_at":"2026-07-05T08:47:46Z"},{"alias_kind":"pith_short_12","alias_value":"TEDLXHNC6YKX","created_at":"2026-07-05T08:47:46Z"},{"alias_kind":"pith_short_16","alias_value":"TEDLXHNC6YKX77ZY","created_at":"2026-07-05T08:47:46Z"},{"alias_kind":"pith_short_8","alias_value":"TEDLXHNC","created_at":"2026-07-05T08:47:46Z"}],"graph_snapshots":[{"event_id":"sha256:b6e63395ade70022dc2eba36d5b77fcb08838d893a895d4ff5bf16e2d0818a2c","target":"graph","created_at":"2026-07-05T08:47:46Z","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/2308.07403/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a directed graph of nodes and edges connecting them, a common problem is to find the shortest path between any two nodes. Here we show that the shortest path distances can be found by a simple matrix inversion: If the edges are given by the adjacency matrix $A_{ij}$ then with a suitably small value of $\\gamma$ the shortest path distances are\n  $$ D_{ij} = \\operatorname{ceil} \\left( \\log_{\\gamma} {\\left[ {\\left({\\mathbf{I}}-\\gamma {\\mathbf{A}}\\right)^{-1}} \\right]}_{ij} \\right)$$\n  We derive several graph-theoretic bounds on the value of $\\gamma$, and explore its useful range with numeric","authors_text":"Markus Meister, Zeyu Jing","cross_cats":["q-bio.NC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-06T05:43:24Z","title":"A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07403","kind":"arxiv","version":2},"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:d1a485369854b062765b2db96938bfd09a5a63ad980fa7e586862c7ce2067b08","target":"record","created_at":"2026-07-05T08:47:46Z","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":"104715eb506b3a7c888e4a39bfbb48b69a3a656c530079660987aec4f8dea209","cross_cats_sorted":["q-bio.NC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-06T05:43:24Z","title_canon_sha256":"e4c2c4f3945a820a93b55fd279744e3b67b54d9fc965c57603b065eebff33a86"},"schema_version":"1.0","source":{"id":"2308.07403","kind":"arxiv","version":2}},"canonical_sha256":"9906bb9da2f6157fff38e8722104d2a4b87a8c612500dbc92e24f76c87bfc27a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9906bb9da2f6157fff38e8722104d2a4b87a8c612500dbc92e24f76c87bfc27a","first_computed_at":"2026-07-05T08:47:46.624886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:47:46.624886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CZZSc+9Bl2CpRSWrZoYsEDbP1VmqkYBDx9U0T0JGM/MA8XQRT6xno9PQ0CP9PfErrwXU1F5wzgWsxiDe7mkFAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:47:46.625379Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.07403","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1a485369854b062765b2db96938bfd09a5a63ad980fa7e586862c7ce2067b08","sha256:b6e63395ade70022dc2eba36d5b77fcb08838d893a895d4ff5bf16e2d0818a2c"],"state_sha256":"61e0a3d3ad1637a0e6c1345307d8714746c53b0ebd6f6dd81ea83dd29a83b1cf"}