{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VYEFL3H2HSUTAZVXBZPHSDNIOR","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":"ed961bc484ce1c07d55c3ad9e8889184ceb1dd495c7da337693da3c8a51ab316","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-05T14:53:11Z","title_canon_sha256":"6201c7d46d9b506778cc1b75783c50a6a03a4a0c0fbe6e110bab2a79ae230540"},"schema_version":"1.0","source":{"id":"1908.01662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01662","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01662v1","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01662","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"VYEFL3H2HSUT","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_16","alias_value":"VYEFL3H2HSUTAZVX","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_8","alias_value":"VYEFL3H2","created_at":"2026-07-04T23:51:32Z"}],"graph_snapshots":[{"event_id":"sha256:176ba5a52aea89299d6d7f0495c838abd00c51c1236b80fdd1f46e6fed8b8a21","target":"graph","created_at":"2026-07-04T23:51:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.01662/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The distance transform algorithm is popular in computer vision and machine learning domains. It is used to minimize quadratic functions over a grid of points. Felzenszwalb and Huttenlocher (2004) describe an O(N) algorithm for computing the minimum distance transform for quadratic functions. Their algorithm works by computing the lower envelope of a set of parabolas defined on the domain of the function. In this work, we describe an average time O(N) algorithm for maximizing this function by computing the upper envelope of a set of parabolas. We study the duality of the minimum and maximum dis","authors_text":"Mihir Sahasrabudhe, Siddhartha Chandra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-05T14:53:11Z","title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01662","kind":"arxiv","version":1},"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:e1ae235e4e0c0608ad31d2b6c447a9de972bf7162cd0e57bc544452758ce1bed","target":"record","created_at":"2026-07-04T23:51:32Z","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":"ed961bc484ce1c07d55c3ad9e8889184ceb1dd495c7da337693da3c8a51ab316","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-05T14:53:11Z","title_canon_sha256":"6201c7d46d9b506778cc1b75783c50a6a03a4a0c0fbe6e110bab2a79ae230540"},"schema_version":"1.0","source":{"id":"1908.01662","kind":"arxiv","version":1}},"canonical_sha256":"ae0855ecfa3ca93066b70e5e790da8745db79d55666cf1a80758b3c9e63ce19d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae0855ecfa3ca93066b70e5e790da8745db79d55666cf1a80758b3c9e63ce19d","first_computed_at":"2026-07-04T23:51:32.528349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:32.528349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x8lvh495jPP+CFfNHnTn6XkmKPXtHuJJukBggLahojqgKge3frVmkiQuLT63/f9zK6lFC9PVySrLFO02i4jeDw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:32.528689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1ae235e4e0c0608ad31d2b6c447a9de972bf7162cd0e57bc544452758ce1bed","sha256:176ba5a52aea89299d6d7f0495c838abd00c51c1236b80fdd1f46e6fed8b8a21"],"state_sha256":"0996cae0a8d331c414d80ab79573dd16f2f18a2ad2647c07bb5bffb9532b3c5c"}