{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CQWZHSOVU6CIJKU4ID2I7GXUK2","short_pith_number":"pith:CQWZHSOV","schema_version":"1.0","canonical_sha256":"142d93c9d5a78484aa9c40f48f9af4568e7c7b577bf1f74a90d5f07881c7bde6","source":{"kind":"arxiv","id":"2112.12165","version":2},"attestation_state":"computed","paper":{"title":"The Universal $\\ell^p$-Metric on Merge Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.AT"],"primary_cat":"cs.CG","authors_text":"Justin Curry, Michael Lesnick, Robert Cardona, Tung Lam","submitted_at":"2021-12-22T19:00:41Z","abstract_excerpt":"Adapting a definition given by Bjerkevik and Lesnick for multiparameter persistence modules, we introduce an $\\ell^p$-type extension of the interleaving distance on merge trees. We show that our distance is a metric, and that it upper-bounds the $p$-Wasserstein distance between the associated barcodes. For each $p\\in[1,\\infty]$, we prove that this distance is stable with respect to cellular sublevel filtrations and that it is the universal (i.e., largest) distance satisfying this stability property. In the $p=\\infty$ case, this gives a novel proof of universality for the interleaving distance "},"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":"2112.12165","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-12-22T19:00:41Z","cross_cats_sorted":["cs.LG","math.AT"],"title_canon_sha256":"2b3449fd080c17711eb383ab5306d8355d60a3538de11b62f316e97a8c4bcac0","abstract_canon_sha256":"c2d9faee219f5e316df4e85eb57b67caadaeeff3c6d5da52db760ea383bdec9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:07:07.072784Z","signature_b64":"Bfdc0YcVkLdd/1TC9pMgSsfxsJaZRlaSlH4+ceTdRLAb9oYXIDqgHsQ5IQ8bVWyMhQPBjMtEdZEDj3cRoKkzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"142d93c9d5a78484aa9c40f48f9af4568e7c7b577bf1f74a90d5f07881c7bde6","last_reissued_at":"2026-07-05T04:07:07.072291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:07:07.072291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Universal $\\ell^p$-Metric on Merge Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.AT"],"primary_cat":"cs.CG","authors_text":"Justin Curry, Michael Lesnick, Robert Cardona, Tung Lam","submitted_at":"2021-12-22T19:00:41Z","abstract_excerpt":"Adapting a definition given by Bjerkevik and Lesnick for multiparameter persistence modules, we introduce an $\\ell^p$-type extension of the interleaving distance on merge trees. We show that our distance is a metric, and that it upper-bounds the $p$-Wasserstein distance between the associated barcodes. For each $p\\in[1,\\infty]$, we prove that this distance is stable with respect to cellular sublevel filtrations and that it is the universal (i.e., largest) distance satisfying this stability property. In the $p=\\infty$ case, this gives a novel proof of universality for the interleaving distance "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.12165","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/2112.12165/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":"2112.12165","created_at":"2026-07-05T04:07:07.072359+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.12165v2","created_at":"2026-07-05T04:07:07.072359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.12165","created_at":"2026-07-05T04:07:07.072359+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQWZHSOVU6CI","created_at":"2026-07-05T04:07:07.072359+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQWZHSOVU6CIJKU4","created_at":"2026-07-05T04:07:07.072359+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQWZHSOV","created_at":"2026-07-05T04:07:07.072359+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.18892","citing_title":"Non-Abelian and Type-A Conformal Anomalies from Euler Descent","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2602.22784","citing_title":"It's All About Covers: Persistent Homology of Cover Refinements","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CQWZHSOVU6CIJKU4ID2I7GXUK2","json":"https://pith.science/pith/CQWZHSOVU6CIJKU4ID2I7GXUK2.json","graph_json":"https://pith.science/api/pith-number/CQWZHSOVU6CIJKU4ID2I7GXUK2/graph.json","events_json":"https://pith.science/api/pith-number/CQWZHSOVU6CIJKU4ID2I7GXUK2/events.json","paper":"https://pith.science/paper/CQWZHSOV"},"agent_actions":{"view_html":"https://pith.science/pith/CQWZHSOVU6CIJKU4ID2I7GXUK2","download_json":"https://pith.science/pith/CQWZHSOVU6CIJKU4ID2I7GXUK2.json","view_paper":"https://pith.science/paper/CQWZHSOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.12165&json=true","fetch_graph":"https://pith.science/api/pith-number/CQWZHSOVU6CIJKU4ID2I7GXUK2/graph.json","fetch_events":"https://pith.science/api/pith-number/CQWZHSOVU6CIJKU4ID2I7GXUK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQWZHSOVU6CIJKU4ID2I7GXUK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQWZHSOVU6CIJKU4ID2I7GXUK2/action/storage_attestation","attest_author":"https://pith.science/pith/CQWZHSOVU6CIJKU4ID2I7GXUK2/action/author_attestation","sign_citation":"https://pith.science/pith/CQWZHSOVU6CIJKU4ID2I7GXUK2/action/citation_signature","submit_replication":"https://pith.science/pith/CQWZHSOVU6CIJKU4ID2I7GXUK2/action/replication_record"}},"created_at":"2026-07-05T04:07:07.072359+00:00","updated_at":"2026-07-05T04:07:07.072359+00:00"}