{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TEDLXHNC6YKX77ZY5BZCCBGSUS","short_pith_number":"pith:TEDLXHNC","schema_version":"1.0","canonical_sha256":"9906bb9da2f6157fff38e8722104d2a4b87a8c612500dbc92e24f76c87bfc27a","source":{"kind":"arxiv","id":"2308.07403","version":2},"attestation_state":"computed","paper":{"title":"A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.NC"],"primary_cat":"cs.DS","authors_text":"Markus Meister, Zeyu Jing","submitted_at":"2023-08-06T05:43:24Z","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"},"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":"2308.07403","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-06T05:43:24Z","cross_cats_sorted":["q-bio.NC"],"title_canon_sha256":"e4c2c4f3945a820a93b55fd279744e3b67b54d9fc965c57603b065eebff33a86","abstract_canon_sha256":"104715eb506b3a7c888e4a39bfbb48b69a3a656c530079660987aec4f8dea209"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:46.625379Z","signature_b64":"CZZSc+9Bl2CpRSWrZoYsEDbP1VmqkYBDx9U0T0JGM/MA8XQRT6xno9PQ0CP9PfErrwXU1F5wzgWsxiDe7mkFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9906bb9da2f6157fff38e8722104d2a4b87a8c612500dbc92e24f76c87bfc27a","last_reissued_at":"2026-07-05T08:47:46.624886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:46.624886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.NC"],"primary_cat":"cs.DS","authors_text":"Markus Meister, Zeyu Jing","submitted_at":"2023-08-06T05:43:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07403","kind":"arxiv","version":2},"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/2308.07403/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":"2308.07403","created_at":"2026-07-05T08:47:46.624944+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.07403v2","created_at":"2026-07-05T08:47:46.624944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07403","created_at":"2026-07-05T08:47:46.624944+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEDLXHNC6YKX","created_at":"2026-07-05T08:47:46.624944+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEDLXHNC6YKX77ZY","created_at":"2026-07-05T08:47:46.624944+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEDLXHNC","created_at":"2026-07-05T08:47:46.624944+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.09200","citing_title":"Accuracy Improvements for Convolutional and Differential Distance Function Approximations","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TEDLXHNC6YKX77ZY5BZCCBGSUS","json":"https://pith.science/pith/TEDLXHNC6YKX77ZY5BZCCBGSUS.json","graph_json":"https://pith.science/api/pith-number/TEDLXHNC6YKX77ZY5BZCCBGSUS/graph.json","events_json":"https://pith.science/api/pith-number/TEDLXHNC6YKX77ZY5BZCCBGSUS/events.json","paper":"https://pith.science/paper/TEDLXHNC"},"agent_actions":{"view_html":"https://pith.science/pith/TEDLXHNC6YKX77ZY5BZCCBGSUS","download_json":"https://pith.science/pith/TEDLXHNC6YKX77ZY5BZCCBGSUS.json","view_paper":"https://pith.science/paper/TEDLXHNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.07403&json=true","fetch_graph":"https://pith.science/api/pith-number/TEDLXHNC6YKX77ZY5BZCCBGSUS/graph.json","fetch_events":"https://pith.science/api/pith-number/TEDLXHNC6YKX77ZY5BZCCBGSUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEDLXHNC6YKX77ZY5BZCCBGSUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEDLXHNC6YKX77ZY5BZCCBGSUS/action/storage_attestation","attest_author":"https://pith.science/pith/TEDLXHNC6YKX77ZY5BZCCBGSUS/action/author_attestation","sign_citation":"https://pith.science/pith/TEDLXHNC6YKX77ZY5BZCCBGSUS/action/citation_signature","submit_replication":"https://pith.science/pith/TEDLXHNC6YKX77ZY5BZCCBGSUS/action/replication_record"}},"created_at":"2026-07-05T08:47:46.624944+00:00","updated_at":"2026-07-05T08:47:46.624944+00:00"}