{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NA7WNWK6WNNALL2HS327EPMJTU","short_pith_number":"pith:NA7WNWK6","schema_version":"1.0","canonical_sha256":"683f66d95eb35a05af4796f5f23d899d3d9cf53e71c961bf1795f9c688292c6c","source":{"kind":"arxiv","id":"1505.01335","version":2},"attestation_state":"computed","paper":{"title":"Comparing persistence diagrams through complex vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"math.AT","authors_text":"Barbara Di Fabio, Massimo Ferri","submitted_at":"2015-05-06T12:13:26Z","abstract_excerpt":"The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from combinatorial explosion. A possible algebraic representation of persistence diagrams is offered by complex polynomials; since far polynomials represent far persistence diagrams, a fast comparison of the coefficient vectors can reduce the size of the database to be classified by the bottleneck distance. This article explores experimentally three transformations"},"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":"1505.01335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2015-05-06T12:13:26Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"bf57254ad2a3c3af1e6a2fe5ece09205e6cc824f2b3aac76d31076b021d891dc","abstract_canon_sha256":"ee7e894291351a0c4c2283150962fc4678a45acf7d0f9a717c03ef6366fc3e7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:10.820154Z","signature_b64":"ta7FNNHtUFTr86NdsG7on6HRKpInVT+Vj7D2BXFt5uXoq82B03+BNWSI7HIbyB127x8cLgEklx5A2fyqAcF2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"683f66d95eb35a05af4796f5f23d899d3d9cf53e71c961bf1795f9c688292c6c","last_reissued_at":"2026-05-18T01:37:10.819561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:10.819561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparing persistence diagrams through complex vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"math.AT","authors_text":"Barbara Di Fabio, Massimo Ferri","submitted_at":"2015-05-06T12:13:26Z","abstract_excerpt":"The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from combinatorial explosion. A possible algebraic representation of persistence diagrams is offered by complex polynomials; since far polynomials represent far persistence diagrams, a fast comparison of the coefficient vectors can reduce the size of the database to be classified by the bottleneck distance. This article explores experimentally three transformations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01335","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":""},"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":"1505.01335","created_at":"2026-05-18T01:37:10.819653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01335v2","created_at":"2026-05-18T01:37:10.819653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01335","created_at":"2026-05-18T01:37:10.819653+00:00"},{"alias_kind":"pith_short_12","alias_value":"NA7WNWK6WNNA","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NA7WNWK6WNNALL2H","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NA7WNWK6","created_at":"2026-05-18T12:29:32.376354+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/NA7WNWK6WNNALL2HS327EPMJTU","json":"https://pith.science/pith/NA7WNWK6WNNALL2HS327EPMJTU.json","graph_json":"https://pith.science/api/pith-number/NA7WNWK6WNNALL2HS327EPMJTU/graph.json","events_json":"https://pith.science/api/pith-number/NA7WNWK6WNNALL2HS327EPMJTU/events.json","paper":"https://pith.science/paper/NA7WNWK6"},"agent_actions":{"view_html":"https://pith.science/pith/NA7WNWK6WNNALL2HS327EPMJTU","download_json":"https://pith.science/pith/NA7WNWK6WNNALL2HS327EPMJTU.json","view_paper":"https://pith.science/paper/NA7WNWK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01335&json=true","fetch_graph":"https://pith.science/api/pith-number/NA7WNWK6WNNALL2HS327EPMJTU/graph.json","fetch_events":"https://pith.science/api/pith-number/NA7WNWK6WNNALL2HS327EPMJTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NA7WNWK6WNNALL2HS327EPMJTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NA7WNWK6WNNALL2HS327EPMJTU/action/storage_attestation","attest_author":"https://pith.science/pith/NA7WNWK6WNNALL2HS327EPMJTU/action/author_attestation","sign_citation":"https://pith.science/pith/NA7WNWK6WNNALL2HS327EPMJTU/action/citation_signature","submit_replication":"https://pith.science/pith/NA7WNWK6WNNALL2HS327EPMJTU/action/replication_record"}},"created_at":"2026-05-18T01:37:10.819653+00:00","updated_at":"2026-05-18T01:37:10.819653+00:00"}