{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:O5CHA6OC3XUNILALSBYMBIDFNN","short_pith_number":"pith:O5CHA6OC","schema_version":"1.0","canonical_sha256":"77447079c2dde8d42c0b9070c0a0656b59dbd7eaae238745a4130593add67bfc","source":{"kind":"arxiv","id":"1707.05095","version":1},"attestation_state":"computed","paper":{"title":"Truly Sub-cubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barna Saha, Fabrizio Grandoni, Karl Bringmann, Virginia Vassilevska Williams","submitted_at":"2017-07-17T11:13:16Z","abstract_excerpt":"It is a major open problem whether the $(\\min,+)$-product of two $n\\times n$ matrices has a truly sub-cubic (i.e. $O(n^{3-\\epsilon})$ for $\\epsilon>0$) time algorithm, in particular since it is equivalent to the famous All-Pairs-Shortest-Paths problem (APSP) in $n$-vertex graphs. Some restrictions of the $(\\min,+)$-product to special types of matrices are known to admit truly sub-cubic algorithms, each giving rise to a special case of APSP that can be solved faster. In this paper we consider a new, different and powerful restriction in which all matrix entries are integers and one matrix can b"},"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":"1707.05095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T11:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"508c8a9ac046e2e62772208508050a84e0aafad2e260f3fb08f9ca02ed3e74ce","abstract_canon_sha256":"83aca5940704498c861a6fae6b4abbf9e5d5b0ca0c08a9e4097f87a1ca69399a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:11.400383Z","signature_b64":"+S8pyazek0i7Fp1N/IJtKX/btsD5ckcaemRMNya7HkjhbvynvPqOHBepJxsLkZDwOogcM+tnwSr+hN7nj7dhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77447079c2dde8d42c0b9070c0a0656b59dbd7eaae238745a4130593add67bfc","last_reissued_at":"2026-05-18T00:40:11.399872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:11.399872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Truly Sub-cubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barna Saha, Fabrizio Grandoni, Karl Bringmann, Virginia Vassilevska Williams","submitted_at":"2017-07-17T11:13:16Z","abstract_excerpt":"It is a major open problem whether the $(\\min,+)$-product of two $n\\times n$ matrices has a truly sub-cubic (i.e. $O(n^{3-\\epsilon})$ for $\\epsilon>0$) time algorithm, in particular since it is equivalent to the famous All-Pairs-Shortest-Paths problem (APSP) in $n$-vertex graphs. Some restrictions of the $(\\min,+)$-product to special types of matrices are known to admit truly sub-cubic algorithms, each giving rise to a special case of APSP that can be solved faster. In this paper we consider a new, different and powerful restriction in which all matrix entries are integers and one matrix can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05095","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":""},"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":"1707.05095","created_at":"2026-05-18T00:40:11.399940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05095v1","created_at":"2026-05-18T00:40:11.399940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05095","created_at":"2026-05-18T00:40:11.399940+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5CHA6OC3XUN","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5CHA6OC3XUNILAL","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5CHA6OC","created_at":"2026-05-18T12:31:34.259226+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/O5CHA6OC3XUNILALSBYMBIDFNN","json":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN.json","graph_json":"https://pith.science/api/pith-number/O5CHA6OC3XUNILALSBYMBIDFNN/graph.json","events_json":"https://pith.science/api/pith-number/O5CHA6OC3XUNILALSBYMBIDFNN/events.json","paper":"https://pith.science/paper/O5CHA6OC"},"agent_actions":{"view_html":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN","download_json":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN.json","view_paper":"https://pith.science/paper/O5CHA6OC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05095&json=true","fetch_graph":"https://pith.science/api/pith-number/O5CHA6OC3XUNILALSBYMBIDFNN/graph.json","fetch_events":"https://pith.science/api/pith-number/O5CHA6OC3XUNILALSBYMBIDFNN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN/action/storage_attestation","attest_author":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN/action/author_attestation","sign_citation":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN/action/citation_signature","submit_replication":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN/action/replication_record"}},"created_at":"2026-05-18T00:40:11.399940+00:00","updated_at":"2026-05-18T00:40:11.399940+00:00"}