{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HSBCW26FVYDF4EJHBLWGSOERY5","short_pith_number":"pith:HSBCW26F","schema_version":"1.0","canonical_sha256":"3c822b6bc5ae065e11270aec693891c7475cce5c9001209d6392f2b0c7553860","source":{"kind":"arxiv","id":"2105.12208","version":2},"attestation_state":"computed","paper":{"title":"A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces for Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CG","authors_text":"Brian Summa, Brittany Terese Fasy, Carola Wenk, Yu Qin","submitted_at":"2021-05-25T20:44:28Z","abstract_excerpt":"Persistence diagrams have been widely used to quantify the underlying features of filtered topological spaces in data visualization. In many applications, computing distances between diagrams is essential; however, computing these distances has been challenging due to the computational cost. In this paper, we propose a persistence diagram hashing framework that learns a binary code representation of persistence diagrams, which allows for fast computation of distances. This framework is built upon a generative adversarial network (GAN) with a diagram distance loss function to steer the learning"},"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":"2105.12208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-05-25T20:44:28Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"258ce97e7c4d2fdb6cbd797776ae7a7c0da024bcfac553c0c6bee5837947818f","abstract_canon_sha256":"3edb41d18d65c9e4f32592d0231b63bcc08001c5805867459026a0ee1b5f49b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:02.541453Z","signature_b64":"7OwkmMSyH4fs8RI8i2iWcum34UJZpHE4+BE8ah6HfejwWZjMDml5IiAYiCYNEzGBognyIETMonEQI7YGuXnUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c822b6bc5ae065e11270aec693891c7475cce5c9001209d6392f2b0c7553860","last_reissued_at":"2026-07-05T03:05:02.541055Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:02.541055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Domain-Oblivious Approach for Learning Concise Representations of Filtered Topological Spaces for Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CG","authors_text":"Brian Summa, Brittany Terese Fasy, Carola Wenk, Yu Qin","submitted_at":"2021-05-25T20:44:28Z","abstract_excerpt":"Persistence diagrams have been widely used to quantify the underlying features of filtered topological spaces in data visualization. In many applications, computing distances between diagrams is essential; however, computing these distances has been challenging due to the computational cost. In this paper, we propose a persistence diagram hashing framework that learns a binary code representation of persistence diagrams, which allows for fast computation of distances. This framework is built upon a generative adversarial network (GAN) with a diagram distance loss function to steer the learning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12208","kind":"arxiv","version":2},"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/2105.12208/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":"2105.12208","created_at":"2026-07-05T03:05:02.541119+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.12208v2","created_at":"2026-07-05T03:05:02.541119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12208","created_at":"2026-07-05T03:05:02.541119+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSBCW26FVYDF","created_at":"2026-07-05T03:05:02.541119+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSBCW26FVYDF4EJH","created_at":"2026-07-05T03:05:02.541119+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSBCW26F","created_at":"2026-07-05T03:05:02.541119+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/HSBCW26FVYDF4EJHBLWGSOERY5","json":"https://pith.science/pith/HSBCW26FVYDF4EJHBLWGSOERY5.json","graph_json":"https://pith.science/api/pith-number/HSBCW26FVYDF4EJHBLWGSOERY5/graph.json","events_json":"https://pith.science/api/pith-number/HSBCW26FVYDF4EJHBLWGSOERY5/events.json","paper":"https://pith.science/paper/HSBCW26F"},"agent_actions":{"view_html":"https://pith.science/pith/HSBCW26FVYDF4EJHBLWGSOERY5","download_json":"https://pith.science/pith/HSBCW26FVYDF4EJHBLWGSOERY5.json","view_paper":"https://pith.science/paper/HSBCW26F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.12208&json=true","fetch_graph":"https://pith.science/api/pith-number/HSBCW26FVYDF4EJHBLWGSOERY5/graph.json","fetch_events":"https://pith.science/api/pith-number/HSBCW26FVYDF4EJHBLWGSOERY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSBCW26FVYDF4EJHBLWGSOERY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSBCW26FVYDF4EJHBLWGSOERY5/action/storage_attestation","attest_author":"https://pith.science/pith/HSBCW26FVYDF4EJHBLWGSOERY5/action/author_attestation","sign_citation":"https://pith.science/pith/HSBCW26FVYDF4EJHBLWGSOERY5/action/citation_signature","submit_replication":"https://pith.science/pith/HSBCW26FVYDF4EJHBLWGSOERY5/action/replication_record"}},"created_at":"2026-07-05T03:05:02.541119+00:00","updated_at":"2026-07-05T03:05:02.541119+00:00"}