{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PLZ3R5MQPWKQDFRD2VYDT2UDEG","short_pith_number":"pith:PLZ3R5MQ","schema_version":"1.0","canonical_sha256":"7af3b8f5907d95019623d57039ea83218e716d3fe9b28fa48782cc0c72fa977c","source":{"kind":"arxiv","id":"1410.2320","version":1},"attestation_state":"computed","paper":{"title":"Computing minimum area homologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","math.AT"],"primary_cat":"cs.CG","authors_text":"Erin Wolf Chambers, Mikael Vejdemo-Johansson","submitted_at":"2014-10-09T00:40:45Z","abstract_excerpt":"Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to "},"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":"1410.2320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-10-09T00:40:45Z","cross_cats_sorted":["cs.GR","math.AT"],"title_canon_sha256":"c266b6272caeb151e8bf0fceb3e7fe4906f1b36314ea724d92381d16029fb17f","abstract_canon_sha256":"149ae68545ce27b961fcb71cd175f2ef89cca76f3376d6c81ad2536da7605bad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:46.691814Z","signature_b64":"NPY1rKyQ2wti4SaP7s1jmV3Lfd1PN/vx8KY78DoVEM6/cOb98P0hx+p5qmqNpfrmbQYLdXBuuvBkovCzvmicCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7af3b8f5907d95019623d57039ea83218e716d3fe9b28fa48782cc0c72fa977c","last_reissued_at":"2026-05-18T02:40:46.691237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:46.691237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing minimum area homologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","math.AT"],"primary_cat":"cs.CG","authors_text":"Erin Wolf Chambers, Mikael Vejdemo-Johansson","submitted_at":"2014-10-09T00:40:45Z","abstract_excerpt":"Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2320","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":"1410.2320","created_at":"2026-05-18T02:40:46.691330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2320v1","created_at":"2026-05-18T02:40:46.691330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2320","created_at":"2026-05-18T02:40:46.691330+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLZ3R5MQPWKQ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLZ3R5MQPWKQDFRD","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLZ3R5MQ","created_at":"2026-05-18T12:28:43.426989+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/PLZ3R5MQPWKQDFRD2VYDT2UDEG","json":"https://pith.science/pith/PLZ3R5MQPWKQDFRD2VYDT2UDEG.json","graph_json":"https://pith.science/api/pith-number/PLZ3R5MQPWKQDFRD2VYDT2UDEG/graph.json","events_json":"https://pith.science/api/pith-number/PLZ3R5MQPWKQDFRD2VYDT2UDEG/events.json","paper":"https://pith.science/paper/PLZ3R5MQ"},"agent_actions":{"view_html":"https://pith.science/pith/PLZ3R5MQPWKQDFRD2VYDT2UDEG","download_json":"https://pith.science/pith/PLZ3R5MQPWKQDFRD2VYDT2UDEG.json","view_paper":"https://pith.science/paper/PLZ3R5MQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2320&json=true","fetch_graph":"https://pith.science/api/pith-number/PLZ3R5MQPWKQDFRD2VYDT2UDEG/graph.json","fetch_events":"https://pith.science/api/pith-number/PLZ3R5MQPWKQDFRD2VYDT2UDEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLZ3R5MQPWKQDFRD2VYDT2UDEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLZ3R5MQPWKQDFRD2VYDT2UDEG/action/storage_attestation","attest_author":"https://pith.science/pith/PLZ3R5MQPWKQDFRD2VYDT2UDEG/action/author_attestation","sign_citation":"https://pith.science/pith/PLZ3R5MQPWKQDFRD2VYDT2UDEG/action/citation_signature","submit_replication":"https://pith.science/pith/PLZ3R5MQPWKQDFRD2VYDT2UDEG/action/replication_record"}},"created_at":"2026-05-18T02:40:46.691330+00:00","updated_at":"2026-05-18T02:40:46.691330+00:00"}