{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:22SB5A7Q5ZEJELZEMQWLEVBVD5","short_pith_number":"pith:22SB5A7Q","schema_version":"1.0","canonical_sha256":"d6a41e83f0ee48922f24642cb254351f72adfd0fb8c58b0fabf3794628a8e71e","source":{"kind":"arxiv","id":"1904.10701","version":1},"attestation_state":"computed","paper":{"title":"Faster Algorithms for All Pairs Non-decreasing Paths Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ce Jin, Hongxun Wu, Ran Duan","submitted_at":"2019-04-24T08:56:58Z","abstract_excerpt":"In this paper, we present an improved algorithm for the All Pairs Non-decreasing Paths (APNP) problem on weighted simple digraphs, which has running time $\\tilde{O}(n^{\\frac{3 + \\omega}{2}}) = \\tilde{O}(n^{2.686})$. Here $n$ is the number of vertices, and $\\omega < 2.373$ is the exponent of time complexity of fast matrix multiplication [Williams 2012, Le Gall 2014]. This matches the current best upper bound for $(\\max, \\min)$-matrix product [Duan, Pettie 2009] which is reducible to APNP. Thus, further improvement for APNP will imply a faster algorithm for $(\\max, \\min)$-matrix product. The pre"},"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":"1904.10701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-24T08:56:58Z","cross_cats_sorted":[],"title_canon_sha256":"879c9ee04c20ac35b76bef925f42e5961377ba8781be104ec837bd16b88a05e2","abstract_canon_sha256":"114c12928cb04c97ad33f291bd36615673f24cd0e6d517a36b3723b631de6259"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:50.276135Z","signature_b64":"IDJN08pd41YwhFKM1pyUJWRj9f1JA0U0iyoqcS2I8n6ArlnQIA0bslNWYFVyISaZgrkn826AiLb5Yhia59XEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6a41e83f0ee48922f24642cb254351f72adfd0fb8c58b0fabf3794628a8e71e","last_reissued_at":"2026-05-17T23:47:50.275690Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:50.275690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for All Pairs Non-decreasing Paths Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ce Jin, Hongxun Wu, Ran Duan","submitted_at":"2019-04-24T08:56:58Z","abstract_excerpt":"In this paper, we present an improved algorithm for the All Pairs Non-decreasing Paths (APNP) problem on weighted simple digraphs, which has running time $\\tilde{O}(n^{\\frac{3 + \\omega}{2}}) = \\tilde{O}(n^{2.686})$. Here $n$ is the number of vertices, and $\\omega < 2.373$ is the exponent of time complexity of fast matrix multiplication [Williams 2012, Le Gall 2014]. This matches the current best upper bound for $(\\max, \\min)$-matrix product [Duan, Pettie 2009] which is reducible to APNP. Thus, further improvement for APNP will imply a faster algorithm for $(\\max, \\min)$-matrix product. The pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10701","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":"1904.10701","created_at":"2026-05-17T23:47:50.275767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10701v1","created_at":"2026-05-17T23:47:50.275767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10701","created_at":"2026-05-17T23:47:50.275767+00:00"},{"alias_kind":"pith_short_12","alias_value":"22SB5A7Q5ZEJ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"22SB5A7Q5ZEJELZE","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"22SB5A7Q","created_at":"2026-05-18T12:33:07.085635+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/22SB5A7Q5ZEJELZEMQWLEVBVD5","json":"https://pith.science/pith/22SB5A7Q5ZEJELZEMQWLEVBVD5.json","graph_json":"https://pith.science/api/pith-number/22SB5A7Q5ZEJELZEMQWLEVBVD5/graph.json","events_json":"https://pith.science/api/pith-number/22SB5A7Q5ZEJELZEMQWLEVBVD5/events.json","paper":"https://pith.science/paper/22SB5A7Q"},"agent_actions":{"view_html":"https://pith.science/pith/22SB5A7Q5ZEJELZEMQWLEVBVD5","download_json":"https://pith.science/pith/22SB5A7Q5ZEJELZEMQWLEVBVD5.json","view_paper":"https://pith.science/paper/22SB5A7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10701&json=true","fetch_graph":"https://pith.science/api/pith-number/22SB5A7Q5ZEJELZEMQWLEVBVD5/graph.json","fetch_events":"https://pith.science/api/pith-number/22SB5A7Q5ZEJELZEMQWLEVBVD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22SB5A7Q5ZEJELZEMQWLEVBVD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22SB5A7Q5ZEJELZEMQWLEVBVD5/action/storage_attestation","attest_author":"https://pith.science/pith/22SB5A7Q5ZEJELZEMQWLEVBVD5/action/author_attestation","sign_citation":"https://pith.science/pith/22SB5A7Q5ZEJELZEMQWLEVBVD5/action/citation_signature","submit_replication":"https://pith.science/pith/22SB5A7Q5ZEJELZEMQWLEVBVD5/action/replication_record"}},"created_at":"2026-05-17T23:47:50.275767+00:00","updated_at":"2026-05-17T23:47:50.275767+00:00"}