{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GJGOHIHRBQDPJK7GVUYROZJ3LK","short_pith_number":"pith:GJGOHIHR","schema_version":"1.0","canonical_sha256":"324ce3a0f10c06f4abe6ad3117653b5a9a7a0f21bd396ded961202f2596e41a8","source":{"kind":"arxiv","id":"1512.07537","version":2},"attestation_state":"computed","paper":{"title":"Linear-Time Fitting of a $k$-Step Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Binay Bhattacharya, Sandip Das, Tsunehiko Kameda","submitted_at":"2015-12-23T16:42:28Z","abstract_excerpt":"Given a set of $n$ weighted points on the $x$-$y$ plane, we want to find a step function consisting of $k$ horizontal steps such that the maximum vertical weighted distance from any point to a step is minimized. We solve this problem in $O(n)$ time when $k$ is a constant. Our approach relies on the prune-and-search technique, and can be adapted to design similar linear time algorithms to solve the line-constrained k-center problem and the size-$k$ histogram construction problem as well."},"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":"1512.07537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-23T16:42:28Z","cross_cats_sorted":[],"title_canon_sha256":"397230dc17ca760a3992bde3a21054aeb06a2bf2dab17b802fa851d00694877c","abstract_canon_sha256":"6a6ecbb1804b26770a8b8ef1fcc024ad95ecc12a168e3a5f90d34048ab8944b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:49.295387Z","signature_b64":"O8+kvVgfQz6z2/9k2DWaeoVQX3BU3nzQ1f76FD5IUoXUalS0M2LZ5C71eCbRy7V/G8lhW9w+uIYv0pwdNkIOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"324ce3a0f10c06f4abe6ad3117653b5a9a7a0f21bd396ded961202f2596e41a8","last_reissued_at":"2026-05-18T01:12:49.295046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:49.295046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Time Fitting of a $k$-Step Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Binay Bhattacharya, Sandip Das, Tsunehiko Kameda","submitted_at":"2015-12-23T16:42:28Z","abstract_excerpt":"Given a set of $n$ weighted points on the $x$-$y$ plane, we want to find a step function consisting of $k$ horizontal steps such that the maximum vertical weighted distance from any point to a step is minimized. We solve this problem in $O(n)$ time when $k$ is a constant. Our approach relies on the prune-and-search technique, and can be adapted to design similar linear time algorithms to solve the line-constrained k-center problem and the size-$k$ histogram construction problem as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07537","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":"1512.07537","created_at":"2026-05-18T01:12:49.295103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07537v2","created_at":"2026-05-18T01:12:49.295103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07537","created_at":"2026-05-18T01:12:49.295103+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJGOHIHRBQDP","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJGOHIHRBQDPJK7G","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJGOHIHR","created_at":"2026-05-18T12:29:22.688609+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/GJGOHIHRBQDPJK7GVUYROZJ3LK","json":"https://pith.science/pith/GJGOHIHRBQDPJK7GVUYROZJ3LK.json","graph_json":"https://pith.science/api/pith-number/GJGOHIHRBQDPJK7GVUYROZJ3LK/graph.json","events_json":"https://pith.science/api/pith-number/GJGOHIHRBQDPJK7GVUYROZJ3LK/events.json","paper":"https://pith.science/paper/GJGOHIHR"},"agent_actions":{"view_html":"https://pith.science/pith/GJGOHIHRBQDPJK7GVUYROZJ3LK","download_json":"https://pith.science/pith/GJGOHIHRBQDPJK7GVUYROZJ3LK.json","view_paper":"https://pith.science/paper/GJGOHIHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07537&json=true","fetch_graph":"https://pith.science/api/pith-number/GJGOHIHRBQDPJK7GVUYROZJ3LK/graph.json","fetch_events":"https://pith.science/api/pith-number/GJGOHIHRBQDPJK7GVUYROZJ3LK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJGOHIHRBQDPJK7GVUYROZJ3LK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJGOHIHRBQDPJK7GVUYROZJ3LK/action/storage_attestation","attest_author":"https://pith.science/pith/GJGOHIHRBQDPJK7GVUYROZJ3LK/action/author_attestation","sign_citation":"https://pith.science/pith/GJGOHIHRBQDPJK7GVUYROZJ3LK/action/citation_signature","submit_replication":"https://pith.science/pith/GJGOHIHRBQDPJK7GVUYROZJ3LK/action/replication_record"}},"created_at":"2026-05-18T01:12:49.295103+00:00","updated_at":"2026-05-18T01:12:49.295103+00:00"}