{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BI37K7BNWSC5QYXXC24XUDGTGF","short_pith_number":"pith:BI37K7BN","canonical_record":{"source":{"id":"1109.1152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-06T11:55:08Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"7d965c7012ef9b9ce49907bc997e956ff1f64dbde9810bce112c8bb85c948cbf","abstract_canon_sha256":"3c0748e9330d6cc4b837a91dcc1d6e8c40c04f63ecf3c719ad3884615b6ceaf2"},"schema_version":"1.0"},"canonical_sha256":"0a37f57c2db485d862f716b97a0cd3314c467b9d66870c1f570cd34c022807f5","source":{"kind":"arxiv","id":"1109.1152","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1152","created_at":"2026-05-18T03:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1152v2","created_at":"2026-05-18T03:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1152","created_at":"2026-05-18T03:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"BI37K7BNWSC5","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BI37K7BNWSC5QYXX","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BI37K7BN","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BI37K7BNWSC5QYXXC24XUDGTGF","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-06T11:55:08Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"7d965c7012ef9b9ce49907bc997e956ff1f64dbde9810bce112c8bb85c948cbf","abstract_canon_sha256":"3c0748e9330d6cc4b837a91dcc1d6e8c40c04f63ecf3c719ad3884615b6ceaf2"},"schema_version":"1.0"},"canonical_sha256":"0a37f57c2db485d862f716b97a0cd3314c467b9d66870c1f570cd34c022807f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:28.678208Z","signature_b64":"jVDQ7MOYfz3QCiCE7NKX4IrQfSZIaPmlpR3m9H5tCL3l/T023hpYrIbZPT1z8AbVmwHTCALL5qSUbW/7NUllCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a37f57c2db485d862f716b97a0cd3314c467b9d66870c1f570cd34c022807f5","last_reissued_at":"2026-05-18T03:43:28.677576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:28.677576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1152","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLArZ+VVWAppoxAe23UaLfkxlR8Aa5rxmX9uZykQ0+B25pSaYEd7YcffOYCPbkUBvRDML8g94wZxMWJxr9o1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:54:53.711206Z"},"content_sha256":"a5095f168597c5132cfd08dc3e8b2b9d99ecf0918f266951f8295a1ce9486e28","schema_version":"1.0","event_id":"sha256:a5095f168597c5132cfd08dc3e8b2b9d99ecf0918f266951f8295a1ce9486e28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BI37K7BNWSC5QYXXC24XUDGTGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A deterministic algorithm for fitting a step function to a weighted point-set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Antoine Vigneron, Herv\\'e Fournier","submitted_at":"2011-09-06T11:55:08Z","abstract_excerpt":"Given a set of n points in the plane, each point having a positive weight, and an integer k>0, we present an optimal O(n \\log n)-time deterministic algorithm to compute a step function with k steps that minimizes the maximum weighted vertical distance to the input points. It matches the expected time bound of the best known randomized algorithm for this problem. Our approach relies on Cole's improved parametric searching technique."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1152","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TnfhzFdTW3MfSuZQTYsyWvlDHQoXaK7IKUwzQSEpKC2PY0cWe/3DCNI0uzm8ZrOcpoyDQ1cEEKIg4dMMqqsoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:54:53.711565Z"},"content_sha256":"99366609dd303625f1b5c14ec257e0fa9936662c46622fcf17e9969bdaaaaeab","schema_version":"1.0","event_id":"sha256:99366609dd303625f1b5c14ec257e0fa9936662c46622fcf17e9969bdaaaaeab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BI37K7BNWSC5QYXXC24XUDGTGF/bundle.json","state_url":"https://pith.science/pith/BI37K7BNWSC5QYXXC24XUDGTGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BI37K7BNWSC5QYXXC24XUDGTGF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T13:54:53Z","links":{"resolver":"https://pith.science/pith/BI37K7BNWSC5QYXXC24XUDGTGF","bundle":"https://pith.science/pith/BI37K7BNWSC5QYXXC24XUDGTGF/bundle.json","state":"https://pith.science/pith/BI37K7BNWSC5QYXXC24XUDGTGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BI37K7BNWSC5QYXXC24XUDGTGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BI37K7BNWSC5QYXXC24XUDGTGF","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":"3c0748e9330d6cc4b837a91dcc1d6e8c40c04f63ecf3c719ad3884615b6ceaf2","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-06T11:55:08Z","title_canon_sha256":"7d965c7012ef9b9ce49907bc997e956ff1f64dbde9810bce112c8bb85c948cbf"},"schema_version":"1.0","source":{"id":"1109.1152","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1152","created_at":"2026-05-18T03:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1152v2","created_at":"2026-05-18T03:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1152","created_at":"2026-05-18T03:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"BI37K7BNWSC5","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BI37K7BNWSC5QYXX","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BI37K7BN","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:99366609dd303625f1b5c14ec257e0fa9936662c46622fcf17e9969bdaaaaeab","target":"graph","created_at":"2026-05-18T03:43:28Z","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 a set of n points in the plane, each point having a positive weight, and an integer k>0, we present an optimal O(n \\log n)-time deterministic algorithm to compute a step function with k steps that minimizes the maximum weighted vertical distance to the input points. It matches the expected time bound of the best known randomized algorithm for this problem. Our approach relies on Cole's improved parametric searching technique.","authors_text":"Antoine Vigneron, Herv\\'e Fournier","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-06T11:55:08Z","title":"A deterministic algorithm for fitting a step function to a weighted point-set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1152","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:a5095f168597c5132cfd08dc3e8b2b9d99ecf0918f266951f8295a1ce9486e28","target":"record","created_at":"2026-05-18T03:43:28Z","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":"3c0748e9330d6cc4b837a91dcc1d6e8c40c04f63ecf3c719ad3884615b6ceaf2","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-06T11:55:08Z","title_canon_sha256":"7d965c7012ef9b9ce49907bc997e956ff1f64dbde9810bce112c8bb85c948cbf"},"schema_version":"1.0","source":{"id":"1109.1152","kind":"arxiv","version":2}},"canonical_sha256":"0a37f57c2db485d862f716b97a0cd3314c467b9d66870c1f570cd34c022807f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a37f57c2db485d862f716b97a0cd3314c467b9d66870c1f570cd34c022807f5","first_computed_at":"2026-05-18T03:43:28.677576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:28.677576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jVDQ7MOYfz3QCiCE7NKX4IrQfSZIaPmlpR3m9H5tCL3l/T023hpYrIbZPT1z8AbVmwHTCALL5qSUbW/7NUllCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:28.678208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1152","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5095f168597c5132cfd08dc3e8b2b9d99ecf0918f266951f8295a1ce9486e28","sha256:99366609dd303625f1b5c14ec257e0fa9936662c46622fcf17e9969bdaaaaeab"],"state_sha256":"4edf28541e73605394d90e5602c858668fbf701a41998e444a4d4e359613acd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouA9rn7A1zry8bCl+0WArLKc7eK01hurve6r2o6+bkqET+WREoEHSdg9zVnhDswgSMFBSX81dZGZoDOfDJv5BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:54:53.713491Z","bundle_sha256":"9b30104d54f5af5e8f7d9dc6b2a7074884f591aa306ca7ea7497807698306068"}}