{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MXOGQ6V6JWDOJCOKAGLL5QM3TU","short_pith_number":"pith:MXOGQ6V6","schema_version":"1.0","canonical_sha256":"65dc687abe4d86e489ca0196bec19b9d3094ea97751482c932b61c5f68d4c595","source":{"kind":"arxiv","id":"1509.05445","version":1},"attestation_state":"computed","paper":{"title":"Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min,+)-convolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eduardo Laber, Ferdinando Cicalese, Wilfredo Bardales Roncalla","submitted_at":"2015-09-17T21:16:38Z","abstract_excerpt":"Given a sequence of n numbers, the Maximum Consecutive Subsums Problem (MCSP) asks for the maximum consecutive sum of lengths l for each l = 1,...,n. No algorithm is known for this problem which is significantly better than the naive quadratic solution. Nor a super linear lower bound is known. The best known bound for the MCSP is based on the the computation of the (min,+)-convolution, another problem for which neither an O(n^{2-{\\epsilon}}) upper bound is known nor a super linear lower bound. We show that the two problems are in fact computationally equivalent by providing linear reductions 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":"1509.05445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-17T21:16:38Z","cross_cats_sorted":[],"title_canon_sha256":"9a3309760e82e5d06d72815101032764bcb6bc5b0c7b98ced423b5b3731dde0d","abstract_canon_sha256":"58bb353ffd3eb6b3e6835e56e5be33664f638e0ed75b422232305bb1b3025a1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:43.187580Z","signature_b64":"aDSW22gslpCfJ4Vluvcr1V02t73LS49MJr55FycuINBgfs2Bnz4od6GJEyasOyKTXtT6pHSMHPt+c3TAQeWiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65dc687abe4d86e489ca0196bec19b9d3094ea97751482c932b61c5f68d4c595","last_reissued_at":"2026-05-18T01:32:43.187046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:43.187046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min,+)-convolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eduardo Laber, Ferdinando Cicalese, Wilfredo Bardales Roncalla","submitted_at":"2015-09-17T21:16:38Z","abstract_excerpt":"Given a sequence of n numbers, the Maximum Consecutive Subsums Problem (MCSP) asks for the maximum consecutive sum of lengths l for each l = 1,...,n. No algorithm is known for this problem which is significantly better than the naive quadratic solution. Nor a super linear lower bound is known. The best known bound for the MCSP is based on the the computation of the (min,+)-convolution, another problem for which neither an O(n^{2-{\\epsilon}}) upper bound is known nor a super linear lower bound. We show that the two problems are in fact computationally equivalent by providing linear reductions b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05445","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":"1509.05445","created_at":"2026-05-18T01:32:43.187123+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05445v1","created_at":"2026-05-18T01:32:43.187123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05445","created_at":"2026-05-18T01:32:43.187123+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXOGQ6V6JWDO","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXOGQ6V6JWDOJCOK","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXOGQ6V6","created_at":"2026-05-18T12:29:32.376354+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/MXOGQ6V6JWDOJCOKAGLL5QM3TU","json":"https://pith.science/pith/MXOGQ6V6JWDOJCOKAGLL5QM3TU.json","graph_json":"https://pith.science/api/pith-number/MXOGQ6V6JWDOJCOKAGLL5QM3TU/graph.json","events_json":"https://pith.science/api/pith-number/MXOGQ6V6JWDOJCOKAGLL5QM3TU/events.json","paper":"https://pith.science/paper/MXOGQ6V6"},"agent_actions":{"view_html":"https://pith.science/pith/MXOGQ6V6JWDOJCOKAGLL5QM3TU","download_json":"https://pith.science/pith/MXOGQ6V6JWDOJCOKAGLL5QM3TU.json","view_paper":"https://pith.science/paper/MXOGQ6V6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05445&json=true","fetch_graph":"https://pith.science/api/pith-number/MXOGQ6V6JWDOJCOKAGLL5QM3TU/graph.json","fetch_events":"https://pith.science/api/pith-number/MXOGQ6V6JWDOJCOKAGLL5QM3TU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXOGQ6V6JWDOJCOKAGLL5QM3TU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXOGQ6V6JWDOJCOKAGLL5QM3TU/action/storage_attestation","attest_author":"https://pith.science/pith/MXOGQ6V6JWDOJCOKAGLL5QM3TU/action/author_attestation","sign_citation":"https://pith.science/pith/MXOGQ6V6JWDOJCOKAGLL5QM3TU/action/citation_signature","submit_replication":"https://pith.science/pith/MXOGQ6V6JWDOJCOKAGLL5QM3TU/action/replication_record"}},"created_at":"2026-05-18T01:32:43.187123+00:00","updated_at":"2026-05-18T01:32:43.187123+00:00"}