{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O5CHA6OC3XUNILALSBYMBIDFNN","short_pith_number":"pith:O5CHA6OC","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"},"canonical_sha256":"77447079c2dde8d42c0b9070c0a0656b59dbd7eaae238745a4130593add67bfc","source":{"kind":"arxiv","id":"1707.05095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05095","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05095v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05095","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"O5CHA6OC3XUN","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O5CHA6OC3XUNILAL","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O5CHA6OC","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O5CHA6OC3XUNILALSBYMBIDFNN","target":"record","payload":{"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"},"canonical_sha256":"77447079c2dde8d42c0b9070c0a0656b59dbd7eaae238745a4130593add67bfc","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"},"source_kind":"arxiv","source_id":"1707.05095","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-05-18T00:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaF0yztBaa0tUGcETn4JNjOahvgxQaE9hAsYy7c3oXd7i+a+mM1aMSY5QGMG5DWsSPK6H+uwQbvljVIV3ckxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:27:14.981703Z"},"content_sha256":"80bff5c70f272d188fba431a511b0fcc9ac634e08a315cf44eaf9ff07189413f","schema_version":"1.0","event_id":"sha256:80bff5c70f272d188fba431a511b0fcc9ac634e08a315cf44eaf9ff07189413f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O5CHA6OC3XUNILALSBYMBIDFNN","target":"graph","payload":{"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"},"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-05-18T00:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvjZ6P9u+90is16Xp6e+qoiV8TJey0PFGKNlRO+mdWPSfPOtj4JDxou4ikrvbLEgjKVN4eRFpaJJKiIFD5TWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T23:27:14.982252Z"},"content_sha256":"e585f201cf60deae2e50cbfd78ac221fb51fcae136b7bd661582f2412cfcb158","schema_version":"1.0","event_id":"sha256:e585f201cf60deae2e50cbfd78ac221fb51fcae136b7bd661582f2412cfcb158"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN/bundle.json","state_url":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5CHA6OC3XUNILALSBYMBIDFNN/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-05-24T23:27:14Z","links":{"resolver":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN","bundle":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN/bundle.json","state":"https://pith.science/pith/O5CHA6OC3XUNILALSBYMBIDFNN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5CHA6OC3XUNILALSBYMBIDFNN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O5CHA6OC3XUNILALSBYMBIDFNN","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":"83aca5940704498c861a6fae6b4abbf9e5d5b0ca0c08a9e4097f87a1ca69399a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T11:13:16Z","title_canon_sha256":"508c8a9ac046e2e62772208508050a84e0aafad2e260f3fb08f9ca02ed3e74ce"},"schema_version":"1.0","source":{"id":"1707.05095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05095","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05095v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05095","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"O5CHA6OC3XUN","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O5CHA6OC3XUNILAL","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O5CHA6OC","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:e585f201cf60deae2e50cbfd78ac221fb51fcae136b7bd661582f2412cfcb158","target":"graph","created_at":"2026-05-18T00:40:11Z","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"},"paper":{"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","authors_text":"Barna Saha, Fabrizio Grandoni, Karl Bringmann, Virginia Vassilevska Williams","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T11:13:16Z","title":"Truly Sub-cubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05095","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:80bff5c70f272d188fba431a511b0fcc9ac634e08a315cf44eaf9ff07189413f","target":"record","created_at":"2026-05-18T00:40:11Z","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":"83aca5940704498c861a6fae6b4abbf9e5d5b0ca0c08a9e4097f87a1ca69399a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-17T11:13:16Z","title_canon_sha256":"508c8a9ac046e2e62772208508050a84e0aafad2e260f3fb08f9ca02ed3e74ce"},"schema_version":"1.0","source":{"id":"1707.05095","kind":"arxiv","version":1}},"canonical_sha256":"77447079c2dde8d42c0b9070c0a0656b59dbd7eaae238745a4130593add67bfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77447079c2dde8d42c0b9070c0a0656b59dbd7eaae238745a4130593add67bfc","first_computed_at":"2026-05-18T00:40:11.399872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:11.399872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+S8pyazek0i7Fp1N/IJtKX/btsD5ckcaemRMNya7HkjhbvynvPqOHBepJxsLkZDwOogcM+tnwSr+hN7nj7dhAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:11.400383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80bff5c70f272d188fba431a511b0fcc9ac634e08a315cf44eaf9ff07189413f","sha256:e585f201cf60deae2e50cbfd78ac221fb51fcae136b7bd661582f2412cfcb158"],"state_sha256":"2b4e6364dbf573396cd48e6b77b596b0cb3aadfcd4c4514dae7f5a02e4cc8c49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SULGq1UsR0VyKa3Dr7JoeRLpoTEuvHJOvE36B3BBi/ktXj2SgGTHI4BkPqDZTSkYCfHiGeAqZHD9/mrwBTyRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T23:27:14.985299Z","bundle_sha256":"740a6cd19e6b16dc465688f81c40246599ab6ea907a13f5c62b4bd8c3e037f68"}}