{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IU36EFG5WBC6ZGUZEBFXFNKM3C","short_pith_number":"pith:IU36EFG5","schema_version":"1.0","canonical_sha256":"4537e214ddb045ec9a99204b72b54cd8aa662b1ee0562cee746c2eb0dfc3cf14","source":{"kind":"arxiv","id":"1904.09378","version":4},"attestation_state":"computed","paper":{"title":"PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signatures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.LG","math.AT"],"primary_cat":"stat.ML","authors_text":"Fr\\'ed\\'eric Chazal, Martin Royer, Mathieu Carri\\`ere, Th\\'eo Lacombe, Yuhei Umeda, Yuichi Ike","submitted_at":"2019-04-20T00:21:59Z","abstract_excerpt":"Persistence diagrams, the most common descriptors of Topological Data Analysis, encode topological properties of data and have already proved pivotal in many different applications of data science. However, since the (metric) space of persistence diagrams is not Hilbert, they end up being difficult inputs for most Machine Learning techniques. To address this concern, several vectorization methods have been put forward that embed persistence diagrams into either finite-dimensional Euclidean space or (implicit) infinite dimensional Hilbert space with kernels. In this work, we focus on persistenc"},"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":"1904.09378","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-04-20T00:21:59Z","cross_cats_sorted":["cs.CG","cs.LG","math.AT"],"title_canon_sha256":"4a55a5a8233aa7b77e8aedc7ee1f385bfcd185e96ff2387cbbab3518239f9d92","abstract_canon_sha256":"d8c52853f4580b410fc0a84db875c83ea904ba1a7cc3af050111258899f35710"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:46:30.670206Z","signature_b64":"hkxHNjSGZpH0IDOoKeRsq0x8HW3rt3Tn4WEy7t4CI4JV4z66wkK0806ayBDuzElk3MnDhRtwlmRba5EWREQqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4537e214ddb045ec9a99204b72b54cd8aa662b1ee0562cee746c2eb0dfc3cf14","last_reissued_at":"2026-07-05T00:46:30.669696Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:46:30.669696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PersLay: A Neural Network Layer for Persistence Diagrams and New Graph Topological Signatures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.LG","math.AT"],"primary_cat":"stat.ML","authors_text":"Fr\\'ed\\'eric Chazal, Martin Royer, Mathieu Carri\\`ere, Th\\'eo Lacombe, Yuhei Umeda, Yuichi Ike","submitted_at":"2019-04-20T00:21:59Z","abstract_excerpt":"Persistence diagrams, the most common descriptors of Topological Data Analysis, encode topological properties of data and have already proved pivotal in many different applications of data science. However, since the (metric) space of persistence diagrams is not Hilbert, they end up being difficult inputs for most Machine Learning techniques. To address this concern, several vectorization methods have been put forward that embed persistence diagrams into either finite-dimensional Euclidean space or (implicit) infinite dimensional Hilbert space with kernels. In this work, we focus on persistenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09378","kind":"arxiv","version":4},"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/1904.09378/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":"1904.09378","created_at":"2026-07-05T00:46:30.669762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09378v4","created_at":"2026-07-05T00:46:30.669762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09378","created_at":"2026-07-05T00:46:30.669762+00:00"},{"alias_kind":"pith_short_12","alias_value":"IU36EFG5WBC6","created_at":"2026-07-05T00:46:30.669762+00:00"},{"alias_kind":"pith_short_16","alias_value":"IU36EFG5WBC6ZGUZ","created_at":"2026-07-05T00:46:30.669762+00:00"},{"alias_kind":"pith_short_8","alias_value":"IU36EFG5","created_at":"2026-07-05T00:46:30.669762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.08708","citing_title":"Persistence Homology of Networks: Methods and Applications","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IU36EFG5WBC6ZGUZEBFXFNKM3C","json":"https://pith.science/pith/IU36EFG5WBC6ZGUZEBFXFNKM3C.json","graph_json":"https://pith.science/api/pith-number/IU36EFG5WBC6ZGUZEBFXFNKM3C/graph.json","events_json":"https://pith.science/api/pith-number/IU36EFG5WBC6ZGUZEBFXFNKM3C/events.json","paper":"https://pith.science/paper/IU36EFG5"},"agent_actions":{"view_html":"https://pith.science/pith/IU36EFG5WBC6ZGUZEBFXFNKM3C","download_json":"https://pith.science/pith/IU36EFG5WBC6ZGUZEBFXFNKM3C.json","view_paper":"https://pith.science/paper/IU36EFG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09378&json=true","fetch_graph":"https://pith.science/api/pith-number/IU36EFG5WBC6ZGUZEBFXFNKM3C/graph.json","fetch_events":"https://pith.science/api/pith-number/IU36EFG5WBC6ZGUZEBFXFNKM3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IU36EFG5WBC6ZGUZEBFXFNKM3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IU36EFG5WBC6ZGUZEBFXFNKM3C/action/storage_attestation","attest_author":"https://pith.science/pith/IU36EFG5WBC6ZGUZEBFXFNKM3C/action/author_attestation","sign_citation":"https://pith.science/pith/IU36EFG5WBC6ZGUZEBFXFNKM3C/action/citation_signature","submit_replication":"https://pith.science/pith/IU36EFG5WBC6ZGUZEBFXFNKM3C/action/replication_record"}},"created_at":"2026-07-05T00:46:30.669762+00:00","updated_at":"2026-07-05T00:46:30.669762+00:00"}