{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JX5RYSO7HSVZM2S2FUKEPUNIBH","short_pith_number":"pith:JX5RYSO7","schema_version":"1.0","canonical_sha256":"4dfb1c49df3cab966a5a2d1447d1a809f85b048212a35ce0491dad40ad9658a5","source":{"kind":"arxiv","id":"1606.03357","version":1},"attestation_state":"computed","paper":{"title":"Geometry Helps to Compare Persistence Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arnur Nigmetov, Dmitriy Morozov, Michael Kerber","submitted_at":"2016-06-10T15:17:26Z","abstract_excerpt":"Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geometry for such problems have not been explored. We implement geometric variants of the Hopcroft--Karp algorithm for bottleneck matching (based on previous work by Efrat el al.) and of the auction algorithm by Bertsekas for Wasserstein distance computation. Both implementations use k-d trees to replace a linear scan with a geometric proximity query. Our interest in this problem stems from the desire to compute distances "},"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":"1606.03357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-10T15:17:26Z","cross_cats_sorted":[],"title_canon_sha256":"bedaafbcb10eba4175178a462aeb4d15f1a8ea40c1c23c2ade4958b271ce0c3b","abstract_canon_sha256":"b3bda3adea4ff93535096ceb2c7f2cfa6e6a11e80183ed1ad1f75f48e40921b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:37.069153Z","signature_b64":"1/tsezKHq0zM9SqXHLPqML59J9RpJHIlm7v34aeLGKuKMPW/vc9UZnfk+srpf1cRy7RvuHO6UW9EHmhMRUPICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dfb1c49df3cab966a5a2d1447d1a809f85b048212a35ce0491dad40ad9658a5","last_reissued_at":"2026-05-18T01:12:37.068803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:37.068803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometry Helps to Compare Persistence Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arnur Nigmetov, Dmitriy Morozov, Michael Kerber","submitted_at":"2016-06-10T15:17:26Z","abstract_excerpt":"Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geometry for such problems have not been explored. We implement geometric variants of the Hopcroft--Karp algorithm for bottleneck matching (based on previous work by Efrat el al.) and of the auction algorithm by Bertsekas for Wasserstein distance computation. Both implementations use k-d trees to replace a linear scan with a geometric proximity query. Our interest in this problem stems from the desire to compute distances "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03357","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":""},"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":"1606.03357","created_at":"2026-05-18T01:12:37.068855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03357v1","created_at":"2026-05-18T01:12:37.068855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03357","created_at":"2026-05-18T01:12:37.068855+00:00"},{"alias_kind":"pith_short_12","alias_value":"JX5RYSO7HSVZ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JX5RYSO7HSVZM2S2","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JX5RYSO7","created_at":"2026-05-18T12:30:25.849896+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/JX5RYSO7HSVZM2S2FUKEPUNIBH","json":"https://pith.science/pith/JX5RYSO7HSVZM2S2FUKEPUNIBH.json","graph_json":"https://pith.science/api/pith-number/JX5RYSO7HSVZM2S2FUKEPUNIBH/graph.json","events_json":"https://pith.science/api/pith-number/JX5RYSO7HSVZM2S2FUKEPUNIBH/events.json","paper":"https://pith.science/paper/JX5RYSO7"},"agent_actions":{"view_html":"https://pith.science/pith/JX5RYSO7HSVZM2S2FUKEPUNIBH","download_json":"https://pith.science/pith/JX5RYSO7HSVZM2S2FUKEPUNIBH.json","view_paper":"https://pith.science/paper/JX5RYSO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03357&json=true","fetch_graph":"https://pith.science/api/pith-number/JX5RYSO7HSVZM2S2FUKEPUNIBH/graph.json","fetch_events":"https://pith.science/api/pith-number/JX5RYSO7HSVZM2S2FUKEPUNIBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JX5RYSO7HSVZM2S2FUKEPUNIBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JX5RYSO7HSVZM2S2FUKEPUNIBH/action/storage_attestation","attest_author":"https://pith.science/pith/JX5RYSO7HSVZM2S2FUKEPUNIBH/action/author_attestation","sign_citation":"https://pith.science/pith/JX5RYSO7HSVZM2S2FUKEPUNIBH/action/citation_signature","submit_replication":"https://pith.science/pith/JX5RYSO7HSVZM2S2FUKEPUNIBH/action/replication_record"}},"created_at":"2026-05-18T01:12:37.068855+00:00","updated_at":"2026-05-18T01:12:37.068855+00:00"}