{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VRODQSO5JQ3FJV4PNAGPDASENT","short_pith_number":"pith:VRODQSO5","schema_version":"1.0","canonical_sha256":"ac5c3849dd4c3654d78f680cf182446cd27c8289a83bc93699135f67cfc75ab8","source":{"kind":"arxiv","id":"1804.05956","version":2},"attestation_state":"computed","paper":{"title":"k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hemant Malik, Ovidiu Daescu","submitted_at":"2018-04-16T21:54:54Z","abstract_excerpt":"Given an array A of n real numbers, the maximum subarray problem is to find a contiguous subarray which has the largest sum. The k-maximum subarrays problem is to find k such subarrays with the largest sums. For the 1-maximum subarray the well known divide-and-conquer algorithm, presented in most textbooks, although suboptimal, is easy to implement and can be made optimal with a simple change that speeds up the combine phase. On the other hand, the only known divide-and-conquer algorithm for k > 1, that is efficient for small values of k, is difficult to implement, due to the intricacies of th"},"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":"1804.05956","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-04-16T21:54:54Z","cross_cats_sorted":[],"title_canon_sha256":"b860ca6766b060a4fa9ea30879872697d72d11c6a97a4fd00615dc0e71e8b33e","abstract_canon_sha256":"cc3c7bda152e2e8c06ea32afdf73c55ce76c7715ca7c92b2e6f2286f607f0bbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:10.325218Z","signature_b64":"FRb/4l/pw0iabkZoaq32G+fF/2z1kmE85odF41gm4+dryAO+qlgvzz3fd1jiPZNRftPX6Je/q0y9o2yrNhe0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac5c3849dd4c3654d78f680cf182446cd27c8289a83bc93699135f67cfc75ab8","last_reissued_at":"2026-05-18T00:10:10.324736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:10.324736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hemant Malik, Ovidiu Daescu","submitted_at":"2018-04-16T21:54:54Z","abstract_excerpt":"Given an array A of n real numbers, the maximum subarray problem is to find a contiguous subarray which has the largest sum. The k-maximum subarrays problem is to find k such subarrays with the largest sums. For the 1-maximum subarray the well known divide-and-conquer algorithm, presented in most textbooks, although suboptimal, is easy to implement and can be made optimal with a simple change that speeds up the combine phase. On the other hand, the only known divide-and-conquer algorithm for k > 1, that is efficient for small values of k, is difficult to implement, due to the intricacies of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05956","kind":"arxiv","version":2},"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":"1804.05956","created_at":"2026-05-18T00:10:10.324815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05956v2","created_at":"2026-05-18T00:10:10.324815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05956","created_at":"2026-05-18T00:10:10.324815+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRODQSO5JQ3F","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRODQSO5JQ3FJV4P","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRODQSO5","created_at":"2026-05-18T12:32:59.047623+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/VRODQSO5JQ3FJV4PNAGPDASENT","json":"https://pith.science/pith/VRODQSO5JQ3FJV4PNAGPDASENT.json","graph_json":"https://pith.science/api/pith-number/VRODQSO5JQ3FJV4PNAGPDASENT/graph.json","events_json":"https://pith.science/api/pith-number/VRODQSO5JQ3FJV4PNAGPDASENT/events.json","paper":"https://pith.science/paper/VRODQSO5"},"agent_actions":{"view_html":"https://pith.science/pith/VRODQSO5JQ3FJV4PNAGPDASENT","download_json":"https://pith.science/pith/VRODQSO5JQ3FJV4PNAGPDASENT.json","view_paper":"https://pith.science/paper/VRODQSO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05956&json=true","fetch_graph":"https://pith.science/api/pith-number/VRODQSO5JQ3FJV4PNAGPDASENT/graph.json","fetch_events":"https://pith.science/api/pith-number/VRODQSO5JQ3FJV4PNAGPDASENT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRODQSO5JQ3FJV4PNAGPDASENT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRODQSO5JQ3FJV4PNAGPDASENT/action/storage_attestation","attest_author":"https://pith.science/pith/VRODQSO5JQ3FJV4PNAGPDASENT/action/author_attestation","sign_citation":"https://pith.science/pith/VRODQSO5JQ3FJV4PNAGPDASENT/action/citation_signature","submit_replication":"https://pith.science/pith/VRODQSO5JQ3FJV4PNAGPDASENT/action/replication_record"}},"created_at":"2026-05-18T00:10:10.324815+00:00","updated_at":"2026-05-18T00:10:10.324815+00:00"}