{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VRODQSO5JQ3FJV4PNAGPDASENT","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":"cc3c7bda152e2e8c06ea32afdf73c55ce76c7715ca7c92b2e6f2286f607f0bbb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-04-16T21:54:54Z","title_canon_sha256":"b860ca6766b060a4fa9ea30879872697d72d11c6a97a4fd00615dc0e71e8b33e"},"schema_version":"1.0","source":{"id":"1804.05956","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05956","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05956v2","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05956","created_at":"2026-05-18T00:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"VRODQSO5JQ3F","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VRODQSO5JQ3FJV4P","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VRODQSO5","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:179c58cd3e5e548670af485f5245c888dd005751131ddd1e6835c0663bb1be57","target":"graph","created_at":"2026-05-18T00:10:10Z","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 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","authors_text":"Hemant Malik, Ovidiu Daescu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-04-16T21:54:54Z","title":"k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05956","kind":"arxiv","version":2},"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:0b16adddf7326b025b85f83565db57e86e5bd41ec1ac7df4d2ce6833e472dfdb","target":"record","created_at":"2026-05-18T00:10:10Z","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":"cc3c7bda152e2e8c06ea32afdf73c55ce76c7715ca7c92b2e6f2286f607f0bbb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-04-16T21:54:54Z","title_canon_sha256":"b860ca6766b060a4fa9ea30879872697d72d11c6a97a4fd00615dc0e71e8b33e"},"schema_version":"1.0","source":{"id":"1804.05956","kind":"arxiv","version":2}},"canonical_sha256":"ac5c3849dd4c3654d78f680cf182446cd27c8289a83bc93699135f67cfc75ab8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac5c3849dd4c3654d78f680cf182446cd27c8289a83bc93699135f67cfc75ab8","first_computed_at":"2026-05-18T00:10:10.324736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:10.324736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FRb/4l/pw0iabkZoaq32G+fF/2z1kmE85odF41gm4+dryAO+qlgvzz3fd1jiPZNRftPX6Je/q0y9o2yrNhe0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:10.325218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05956","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b16adddf7326b025b85f83565db57e86e5bd41ec1ac7df4d2ce6833e472dfdb","sha256:179c58cd3e5e548670af485f5245c888dd005751131ddd1e6835c0663bb1be57"],"state_sha256":"57aef9cd6ef3874e6d6d86f80d36610013f0a701bd5223a08ba9490dddf18672"}