{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VYEFL3H2HSUTAZVXBZPHSDNIOR","short_pith_number":"pith:VYEFL3H2","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"},"canonical_sha256":"ae0855ecfa3ca93066b70e5e790da8745db79d55666cf1a80758b3c9e63ce19d","source":{"kind":"arxiv","id":"1908.01662","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VYEFL3H2HSUTAZVXBZPHSDNIOR","target":"record","payload":{"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"},"canonical_sha256":"ae0855ecfa3ca93066b70e5e790da8745db79d55666cf1a80758b3c9e63ce19d","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"},"source_kind":"arxiv","source_id":"1908.01662","source_version":1,"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-07-04T23:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVSNDoYF0q7fshOBrqB1dyIfvLPpnNBQVvefOMtBZmkxf4SgEW1NStpVvtsowl//bzur/DZU3brWdL5+SjFKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:51:41.061205Z"},"content_sha256":"e1ae235e4e0c0608ad31d2b6c447a9de972bf7162cd0e57bc544452758ce1bed","schema_version":"1.0","event_id":"sha256:e1ae235e4e0c0608ad31d2b6c447a9de972bf7162cd0e57bc544452758ce1bed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VYEFL3H2HSUTAZVXBZPHSDNIOR","target":"graph","payload":{"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"},"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-07-04T23:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tt3JsPBLNag7ki/PAt3kTSnZ1JoLa+RtR6wacAt4+CgqCCdxrrkUnl7zUTlo2JJyAsC46WzGMwGlNxCZ6Hz9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:51:41.061725Z"},"content_sha256":"176ba5a52aea89299d6d7f0495c838abd00c51c1236b80fdd1f46e6fed8b8a21","schema_version":"1.0","event_id":"sha256:176ba5a52aea89299d6d7f0495c838abd00c51c1236b80fdd1f46e6fed8b8a21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/bundle.json","state_url":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/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-08-16T16:51:41Z","links":{"resolver":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR","bundle":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/bundle.json","state":"https://pith.science/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYEFL3H2HSUTAZVXBZPHSDNIOR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FeTr7Z99F6zx/ULKZ3yw1epUgNDRNkEUjIlooIck5DMZlwZsS7mMvfyJ86tdeo3C885wJMCBrfH6GWQON5vvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:51:41.069914Z","bundle_sha256":"f0b503e9a861cda94336358d5e60a83a0fa5f95b822adece3d37368cda26b89f"}}