{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HKI3S4FC7P67Y3KD5FXHCJI4QH","short_pith_number":"pith:HKI3S4FC","schema_version":"1.0","canonical_sha256":"3a91b970a2fbfdfc6d43e96e71251c81e204e1b1c895465e607dda575e7250a0","source":{"kind":"arxiv","id":"2304.13307","version":2},"attestation_state":"computed","paper":{"title":"A Statistical Interpretation of the Maximum Subarray Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Dennis Wei, Dmitry M. Malioutov","submitted_at":"2023-04-26T06:22:22Z","abstract_excerpt":"Maximum subarray is a classical problem in computer science that given an array of numbers aims to find a contiguous subarray with the largest sum. We focus on its use for a noisy statistical problem of localizing an interval with a mean different from background. While a naive application of maximum subarray fails at this task, both a penalized and a constrained version can succeed. We show that the penalized version can be derived for common exponential family distributions, in a manner similar to the change-point detection literature, and we interpret the resulting optimal penalty value. 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":"2304.13307","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-04-26T06:22:22Z","cross_cats_sorted":[],"title_canon_sha256":"6fe334c4bf7075a7d425cc2671d80ee7ccfb8e4a5edc68fdde5707cc1bf785e7","abstract_canon_sha256":"4c89d02ae31e8d3ac7aa700c78a4c3b7ec60a2f1ce4333aade19b95a4511d154"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:03:23.588016Z","signature_b64":"edoA4a4bRhUFDPFbXk7jTLE5SPSdrYO5AzHWrntnUxDYIq3BKuPRXg8r/D1Mj5OBUPYp/xSVBDVjqrdmvB/mAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a91b970a2fbfdfc6d43e96e71251c81e204e1b1c895465e607dda575e7250a0","last_reissued_at":"2026-07-05T07:03:23.587546Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:03:23.587546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Statistical Interpretation of the Maximum Subarray Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Dennis Wei, Dmitry M. Malioutov","submitted_at":"2023-04-26T06:22:22Z","abstract_excerpt":"Maximum subarray is a classical problem in computer science that given an array of numbers aims to find a contiguous subarray with the largest sum. We focus on its use for a noisy statistical problem of localizing an interval with a mean different from background. While a naive application of maximum subarray fails at this task, both a penalized and a constrained version can succeed. We show that the penalized version can be derived for common exponential family distributions, in a manner similar to the change-point detection literature, and we interpret the resulting optimal penalty value. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.13307","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.13307/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.13307","created_at":"2026-07-05T07:03:23.587599+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.13307v2","created_at":"2026-07-05T07:03:23.587599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.13307","created_at":"2026-07-05T07:03:23.587599+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKI3S4FC7P67","created_at":"2026-07-05T07:03:23.587599+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKI3S4FC7P67Y3KD","created_at":"2026-07-05T07:03:23.587599+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKI3S4FC","created_at":"2026-07-05T07:03:23.587599+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/HKI3S4FC7P67Y3KD5FXHCJI4QH","json":"https://pith.science/pith/HKI3S4FC7P67Y3KD5FXHCJI4QH.json","graph_json":"https://pith.science/api/pith-number/HKI3S4FC7P67Y3KD5FXHCJI4QH/graph.json","events_json":"https://pith.science/api/pith-number/HKI3S4FC7P67Y3KD5FXHCJI4QH/events.json","paper":"https://pith.science/paper/HKI3S4FC"},"agent_actions":{"view_html":"https://pith.science/pith/HKI3S4FC7P67Y3KD5FXHCJI4QH","download_json":"https://pith.science/pith/HKI3S4FC7P67Y3KD5FXHCJI4QH.json","view_paper":"https://pith.science/paper/HKI3S4FC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.13307&json=true","fetch_graph":"https://pith.science/api/pith-number/HKI3S4FC7P67Y3KD5FXHCJI4QH/graph.json","fetch_events":"https://pith.science/api/pith-number/HKI3S4FC7P67Y3KD5FXHCJI4QH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKI3S4FC7P67Y3KD5FXHCJI4QH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKI3S4FC7P67Y3KD5FXHCJI4QH/action/storage_attestation","attest_author":"https://pith.science/pith/HKI3S4FC7P67Y3KD5FXHCJI4QH/action/author_attestation","sign_citation":"https://pith.science/pith/HKI3S4FC7P67Y3KD5FXHCJI4QH/action/citation_signature","submit_replication":"https://pith.science/pith/HKI3S4FC7P67Y3KD5FXHCJI4QH/action/replication_record"}},"created_at":"2026-07-05T07:03:23.587599+00:00","updated_at":"2026-07-05T07:03:23.587599+00:00"}