{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PR4FCZLCJK4SANSNJPSZL2DLV7","short_pith_number":"pith:PR4FCZLC","schema_version":"1.0","canonical_sha256":"7c785165624ab920364d4be595e86bafc63850d565034f0d3de7621d3cee80e2","source":{"kind":"arxiv","id":"1802.10457","version":2},"attestation_state":"computed","paper":{"title":"The density of expected persistence diagrams and its kernel based estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fr\\'ed\\'eric Chazal, Vincent Divol","submitted_at":"2018-02-28T14:58:19Z","abstract_excerpt":"Persistence diagrams play a fundamental role in Topological Data Analysis where they are used as topological descriptors of filtrations built on top of data. They consist in discrete multisets of points in the plane $\\mathbb{R}^2$ that can equivalently be seen as discrete measures in $\\mathbb{R}^2$. When the data come as a random point cloud, these discrete measures become random measures whose expectation is studied in this paper. First, we show that for a wide class of filtrations, including the \\v{C}ech and Rips-Vietoris filtrations, the expected persistence diagram, that is a deterministic"},"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":"1802.10457","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2018-02-28T14:58:19Z","cross_cats_sorted":[],"title_canon_sha256":"4f9d340fd360ded8e6c1a4bd2380158e922fe2d61bf11e6adbf8e514681d4484","abstract_canon_sha256":"e20bf5f538c3df4a0fd8ac3a221e0359604822bda97f48e4c23dad9d35714034"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:42.801584Z","signature_b64":"vHbr6lzMGzHlUoyMfbUny+fSKzyD05WrQ4gCsXY7gyccnsQC73M9+H9owb2/jWaYmJYFwD1CKxzjWjyCf6G+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c785165624ab920364d4be595e86bafc63850d565034f0d3de7621d3cee80e2","last_reissued_at":"2026-05-17T23:50:42.801056Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:42.801056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The density of expected persistence diagrams and its kernel based estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fr\\'ed\\'eric Chazal, Vincent Divol","submitted_at":"2018-02-28T14:58:19Z","abstract_excerpt":"Persistence diagrams play a fundamental role in Topological Data Analysis where they are used as topological descriptors of filtrations built on top of data. They consist in discrete multisets of points in the plane $\\mathbb{R}^2$ that can equivalently be seen as discrete measures in $\\mathbb{R}^2$. When the data come as a random point cloud, these discrete measures become random measures whose expectation is studied in this paper. First, we show that for a wide class of filtrations, including the \\v{C}ech and Rips-Vietoris filtrations, the expected persistence diagram, that is a deterministic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10457","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":"1802.10457","created_at":"2026-05-17T23:50:42.801144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10457v2","created_at":"2026-05-17T23:50:42.801144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10457","created_at":"2026-05-17T23:50:42.801144+00:00"},{"alias_kind":"pith_short_12","alias_value":"PR4FCZLCJK4S","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PR4FCZLCJK4SANSN","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PR4FCZLC","created_at":"2026-05-18T12:32:46.962924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09178","citing_title":"Enhancing Graph Representation Learning with Localized Topological Features","ref_index":2019,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PR4FCZLCJK4SANSNJPSZL2DLV7","json":"https://pith.science/pith/PR4FCZLCJK4SANSNJPSZL2DLV7.json","graph_json":"https://pith.science/api/pith-number/PR4FCZLCJK4SANSNJPSZL2DLV7/graph.json","events_json":"https://pith.science/api/pith-number/PR4FCZLCJK4SANSNJPSZL2DLV7/events.json","paper":"https://pith.science/paper/PR4FCZLC"},"agent_actions":{"view_html":"https://pith.science/pith/PR4FCZLCJK4SANSNJPSZL2DLV7","download_json":"https://pith.science/pith/PR4FCZLCJK4SANSNJPSZL2DLV7.json","view_paper":"https://pith.science/paper/PR4FCZLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10457&json=true","fetch_graph":"https://pith.science/api/pith-number/PR4FCZLCJK4SANSNJPSZL2DLV7/graph.json","fetch_events":"https://pith.science/api/pith-number/PR4FCZLCJK4SANSNJPSZL2DLV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PR4FCZLCJK4SANSNJPSZL2DLV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PR4FCZLCJK4SANSNJPSZL2DLV7/action/storage_attestation","attest_author":"https://pith.science/pith/PR4FCZLCJK4SANSNJPSZL2DLV7/action/author_attestation","sign_citation":"https://pith.science/pith/PR4FCZLCJK4SANSNJPSZL2DLV7/action/citation_signature","submit_replication":"https://pith.science/pith/PR4FCZLCJK4SANSNJPSZL2DLV7/action/replication_record"}},"created_at":"2026-05-17T23:50:42.801144+00:00","updated_at":"2026-05-17T23:50:42.801144+00:00"}