{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MXOGQ6V6JWDOJCOKAGLL5QM3TU","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":"58bb353ffd3eb6b3e6835e56e5be33664f638e0ed75b422232305bb1b3025a1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-17T21:16:38Z","title_canon_sha256":"9a3309760e82e5d06d72815101032764bcb6bc5b0c7b98ced423b5b3731dde0d"},"schema_version":"1.0","source":{"id":"1509.05445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05445","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05445v1","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05445","created_at":"2026-05-18T01:32:43Z"},{"alias_kind":"pith_short_12","alias_value":"MXOGQ6V6JWDO","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXOGQ6V6JWDOJCOK","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXOGQ6V6","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:e4f796e8758f83e1c33fe3d35b5d6d78fa0a9d4dbc6181c3cc4fb5b13750a38b","target":"graph","created_at":"2026-05-18T01:32:43Z","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":"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","authors_text":"Eduardo Laber, Ferdinando Cicalese, Wilfredo Bardales Roncalla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-17T21:16:38Z","title":"Searching for a superlinear lower bounds for the Maximum Consecutive Subsums Problem and the (min,+)-convolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05445","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:f64686e449dd25284611081ca1956b2e3eaa52c8648f2a24def0ac35c73cc06b","target":"record","created_at":"2026-05-18T01:32:43Z","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":"58bb353ffd3eb6b3e6835e56e5be33664f638e0ed75b422232305bb1b3025a1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-17T21:16:38Z","title_canon_sha256":"9a3309760e82e5d06d72815101032764bcb6bc5b0c7b98ced423b5b3731dde0d"},"schema_version":"1.0","source":{"id":"1509.05445","kind":"arxiv","version":1}},"canonical_sha256":"65dc687abe4d86e489ca0196bec19b9d3094ea97751482c932b61c5f68d4c595","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65dc687abe4d86e489ca0196bec19b9d3094ea97751482c932b61c5f68d4c595","first_computed_at":"2026-05-18T01:32:43.187046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:43.187046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aDSW22gslpCfJ4Vluvcr1V02t73LS49MJr55FycuINBgfs2Bnz4od6GJEyasOyKTXtT6pHSMHPt+c3TAQeWiDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:43.187580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f64686e449dd25284611081ca1956b2e3eaa52c8648f2a24def0ac35c73cc06b","sha256:e4f796e8758f83e1c33fe3d35b5d6d78fa0a9d4dbc6181c3cc4fb5b13750a38b"],"state_sha256":"d815d650e0d235784178858ae47bc0ad81bf6e08245f3b0b3bd3c8009b23692e"}