{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SBKNOXEO4AE6QDKAN2JC2PG3NG","short_pith_number":"pith:SBKNOXEO","schema_version":"1.0","canonical_sha256":"9054d75c8ee009e80d406e922d3cdb69abc752bd2b9c77e9ed8feff6d8666fca","source":{"kind":"arxiv","id":"1410.2847","version":3},"attestation_state":"computed","paper":{"title":"Encodings of Range Maximum-Sum Segment Queries and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Patrick K. Nicholson, Pawel Gawrychowski","submitted_at":"2014-10-10T17:36:52Z","abstract_excerpt":"Given an array A containing arbitrary (positive and negative) numbers, we consider the problem of supporting range maximum-sum segment queries on A: i.e., given an arbitrary range [i,j], return the subrange [i' ,j' ] \\subseteq [i,j] such that the sum of the numbers in A[i'..j'] is maximized. Chen and Chao [Disc. App. Math. 2007] presented a data structure for this problem that occupies {\\Theta}(n) words, can be constructed in {\\Theta}(n) time, and supports queries in {\\Theta}(1) time. Our first result is that if only the indices [i',j'] are desired (rather than the maximum sum achieved in that"},"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":"1410.2847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-10T17:36:52Z","cross_cats_sorted":[],"title_canon_sha256":"cf7944ad4d38f04512de458339f1529c1a0ab435a3551913177e0c3da0c56be5","abstract_canon_sha256":"97795df864833504563403ac3922ce95a92feee8287334649f172653879579e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:09.131356Z","signature_b64":"RRyBJ4DZQ6sCP1XuPdZUr9JdpjMLtH5mvZkY0Vp6whs91Z4mBu8G35CHjoDzavW/sSrw9k/JDlrFhsuXcTJWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9054d75c8ee009e80d406e922d3cdb69abc752bd2b9c77e9ed8feff6d8666fca","last_reissued_at":"2026-05-18T01:53:09.130923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:09.130923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Encodings of Range Maximum-Sum Segment Queries and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Patrick K. Nicholson, Pawel Gawrychowski","submitted_at":"2014-10-10T17:36:52Z","abstract_excerpt":"Given an array A containing arbitrary (positive and negative) numbers, we consider the problem of supporting range maximum-sum segment queries on A: i.e., given an arbitrary range [i,j], return the subrange [i' ,j' ] \\subseteq [i,j] such that the sum of the numbers in A[i'..j'] is maximized. Chen and Chao [Disc. App. Math. 2007] presented a data structure for this problem that occupies {\\Theta}(n) words, can be constructed in {\\Theta}(n) time, and supports queries in {\\Theta}(1) time. Our first result is that if only the indices [i',j'] are desired (rather than the maximum sum achieved in that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2847","kind":"arxiv","version":3},"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":"1410.2847","created_at":"2026-05-18T01:53:09.130993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2847v3","created_at":"2026-05-18T01:53:09.130993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2847","created_at":"2026-05-18T01:53:09.130993+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBKNOXEO4AE6","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBKNOXEO4AE6QDKA","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBKNOXEO","created_at":"2026-05-18T12:28:49.207871+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/SBKNOXEO4AE6QDKAN2JC2PG3NG","json":"https://pith.science/pith/SBKNOXEO4AE6QDKAN2JC2PG3NG.json","graph_json":"https://pith.science/api/pith-number/SBKNOXEO4AE6QDKAN2JC2PG3NG/graph.json","events_json":"https://pith.science/api/pith-number/SBKNOXEO4AE6QDKAN2JC2PG3NG/events.json","paper":"https://pith.science/paper/SBKNOXEO"},"agent_actions":{"view_html":"https://pith.science/pith/SBKNOXEO4AE6QDKAN2JC2PG3NG","download_json":"https://pith.science/pith/SBKNOXEO4AE6QDKAN2JC2PG3NG.json","view_paper":"https://pith.science/paper/SBKNOXEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2847&json=true","fetch_graph":"https://pith.science/api/pith-number/SBKNOXEO4AE6QDKAN2JC2PG3NG/graph.json","fetch_events":"https://pith.science/api/pith-number/SBKNOXEO4AE6QDKAN2JC2PG3NG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBKNOXEO4AE6QDKAN2JC2PG3NG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBKNOXEO4AE6QDKAN2JC2PG3NG/action/storage_attestation","attest_author":"https://pith.science/pith/SBKNOXEO4AE6QDKAN2JC2PG3NG/action/author_attestation","sign_citation":"https://pith.science/pith/SBKNOXEO4AE6QDKAN2JC2PG3NG/action/citation_signature","submit_replication":"https://pith.science/pith/SBKNOXEO4AE6QDKAN2JC2PG3NG/action/replication_record"}},"created_at":"2026-05-18T01:53:09.130993+00:00","updated_at":"2026-05-18T01:53:09.130993+00:00"}