{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7OU5E3LS3YDIKEIJ35536L7NDC","short_pith_number":"pith:7OU5E3LS","schema_version":"1.0","canonical_sha256":"fba9d26d72de06851109df7bbf2fed1885ee88d987a4c1232518faa3413cb057","source":{"kind":"arxiv","id":"1710.11489","version":1},"attestation_state":"computed","paper":{"title":"Interleaving Distance as a Limit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.AT","authors_text":"David Meyer, Killian Meehan","submitted_at":"2017-10-30T00:10:45Z","abstract_excerpt":"Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors proved an analogue of the isometry theorem of Bauer and Lesnick for representations of a certain class of finite posets. The isometry was between the interleaving metric of Bubenik, de Silva and Scott and a bottleneck metric which incorporated algebraic information. The key step in both isometry theorems was proving a matching theorem, that an interleaving gives"},"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":"1710.11489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2017-10-30T00:10:45Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"ac3475f68f40bfd9e0ef5b2c9c5b40b189cac1f566665caa716b31b273117a0c","abstract_canon_sha256":"a3364572cac577c724505466a11af2ab158f4968e77c4f8effb1f237e426ed81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:37.170445Z","signature_b64":"eePHh72mqfIuG/8AgoobchwMhwSie97KQYJj++3TMo/mDVGVyt7khyhceOG7OGf48dvSafMea9rKg43GsCCHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fba9d26d72de06851109df7bbf2fed1885ee88d987a4c1232518faa3413cb057","last_reissued_at":"2026-05-18T00:31:37.169951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:37.169951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interleaving Distance as a Limit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.AT","authors_text":"David Meyer, Killian Meehan","submitted_at":"2017-10-30T00:10:45Z","abstract_excerpt":"Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors proved an analogue of the isometry theorem of Bauer and Lesnick for representations of a certain class of finite posets. The isometry was between the interleaving metric of Bubenik, de Silva and Scott and a bottleneck metric which incorporated algebraic information. The key step in both isometry theorems was proving a matching theorem, that an interleaving gives"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11489","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":"1710.11489","created_at":"2026-05-18T00:31:37.170028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11489v1","created_at":"2026-05-18T00:31:37.170028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11489","created_at":"2026-05-18T00:31:37.170028+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OU5E3LS3YDI","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OU5E3LS3YDIKEIJ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OU5E3LS","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.03865","citing_title":"Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7OU5E3LS3YDIKEIJ35536L7NDC","json":"https://pith.science/pith/7OU5E3LS3YDIKEIJ35536L7NDC.json","graph_json":"https://pith.science/api/pith-number/7OU5E3LS3YDIKEIJ35536L7NDC/graph.json","events_json":"https://pith.science/api/pith-number/7OU5E3LS3YDIKEIJ35536L7NDC/events.json","paper":"https://pith.science/paper/7OU5E3LS"},"agent_actions":{"view_html":"https://pith.science/pith/7OU5E3LS3YDIKEIJ35536L7NDC","download_json":"https://pith.science/pith/7OU5E3LS3YDIKEIJ35536L7NDC.json","view_paper":"https://pith.science/paper/7OU5E3LS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11489&json=true","fetch_graph":"https://pith.science/api/pith-number/7OU5E3LS3YDIKEIJ35536L7NDC/graph.json","fetch_events":"https://pith.science/api/pith-number/7OU5E3LS3YDIKEIJ35536L7NDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OU5E3LS3YDIKEIJ35536L7NDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OU5E3LS3YDIKEIJ35536L7NDC/action/storage_attestation","attest_author":"https://pith.science/pith/7OU5E3LS3YDIKEIJ35536L7NDC/action/author_attestation","sign_citation":"https://pith.science/pith/7OU5E3LS3YDIKEIJ35536L7NDC/action/citation_signature","submit_replication":"https://pith.science/pith/7OU5E3LS3YDIKEIJ35536L7NDC/action/replication_record"}},"created_at":"2026-05-18T00:31:37.170028+00:00","updated_at":"2026-05-18T00:31:37.170028+00:00"}