{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VYEFL3H2HSUTAZVXBZPHSDNIOR","short_pith_number":"pith:VYEFL3H2","schema_version":"1.0","canonical_sha256":"ae0855ecfa3ca93066b70e5e790da8745db79d55666cf1a80758b3c9e63ce19d","source":{"kind":"arxiv","id":"1908.01662","version":1},"attestation_state":"computed","paper":{"title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mihir Sahasrabudhe, Siddhartha Chandra","submitted_at":"2019-08-05T14:53:11Z","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"},"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":"1908.01662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-05T14:53:11Z","cross_cats_sorted":[],"title_canon_sha256":"6201c7d46d9b506778cc1b75783c50a6a03a4a0c0fbe6e110bab2a79ae230540","abstract_canon_sha256":"ed961bc484ce1c07d55c3ad9e8889184ceb1dd495c7da337693da3c8a51ab316"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:32.528689Z","signature_b64":"x8lvh495jPP+CFfNHnTn6XkmKPXtHuJJukBggLahojqgKge3frVmkiQuLT63/f9zK6lFC9PVySrLFO02i4jeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae0855ecfa3ca93066b70e5e790da8745db79d55666cf1a80758b3c9e63ce19d","last_reissued_at":"2026-07-04T23:51:32.528349Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:32.528349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mihir Sahasrabudhe, Siddhartha Chandra","submitted_at":"2019-08-05T14:53:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01662","kind":"arxiv","version":1},"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/1908.01662/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":"1908.01662","created_at":"2026-07-04T23:51:32.528409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01662v1","created_at":"2026-07-04T23:51:32.528409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01662","created_at":"2026-07-04T23:51:32.528409+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYEFL3H2HSUT","created_at":"2026-07-04T23:51:32.528409+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYEFL3H2HSUTAZVX","created_at":"2026-07-04T23:51:32.528409+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYEFL3H2","created_at":"2026-07-04T23:51:32.528409+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/VYEFL3H2HSUTAZVXBZPHSDNIOR","json":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR.json","graph_json":"https://pith.science/api/pith-number/VYEFL3H2HSUTAZVXBZPHSDNIOR/graph.json","events_json":"https://pith.science/api/pith-number/VYEFL3H2HSUTAZVXBZPHSDNIOR/events.json","paper":"https://pith.science/paper/VYEFL3H2"},"agent_actions":{"view_html":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR","download_json":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR.json","view_paper":"https://pith.science/paper/VYEFL3H2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01662&json=true","fetch_graph":"https://pith.science/api/pith-number/VYEFL3H2HSUTAZVXBZPHSDNIOR/graph.json","fetch_events":"https://pith.science/api/pith-number/VYEFL3H2HSUTAZVXBZPHSDNIOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/action/storage_attestation","attest_author":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/action/author_attestation","sign_citation":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/action/citation_signature","submit_replication":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/action/replication_record"}},"created_at":"2026-07-04T23:51:32.528409+00:00","updated_at":"2026-07-04T23:51:32.528409+00:00"}