{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5HGDAXHY2SNLMHEWZHPS4II44I","short_pith_number":"pith:5HGDAXHY","schema_version":"1.0","canonical_sha256":"e9cc305cf8d49ab61c96c9df2e211ce21e26d30c980e3da76b9977443f96c599","source":{"kind":"arxiv","id":"2406.07224","version":2},"attestation_state":"computed","paper":{"title":"Differentiability and Optimization of Multiparameter Persistent Homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.OC"],"primary_cat":"cs.CG","authors_text":"David Loiseaux, Luis Scoccola, Mathieu Carri\\`ere, Siddharth Setlur, Steve Oudot","submitted_at":"2024-06-11T13:03:43Z","abstract_excerpt":"Real-valued functions on geometric data -- such as node attributes on a graph -- can be optimized using descriptors from persistent homology, allowing the user to incorporate topological terms in the loss function. When optimizing a single real-valued function (the one-parameter setting), there is a canonical choice of descriptor for persistent homology: the barcode. The operation mapping a real-valued function to its barcode is differentiable almost everywhere, and the convergence of gradient descent for losses using barcodes is relatively well understood. When optimizing a vector-valued func"},"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":"2406.07224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-06-11T13:03:43Z","cross_cats_sorted":["math.AT","math.OC"],"title_canon_sha256":"86c2954181a0f21621bb4098dc6621c1f83f13829abec11697d1fe8ac8a72af5","abstract_canon_sha256":"7c77166ec17b970cc84208a57cd8c3e728b0da0b43b0e1e3bcbdb08dc73a4be7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:01:02.689671Z","signature_b64":"kbt80jkwJLGqkWk8YlkiA3dDcEYBmUmGDmsTW5+n1Lqc0qCFI4TDv5kXF4X+zPBDSjuDQFHVZitEYGbJqGCiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9cc305cf8d49ab61c96c9df2e211ce21e26d30c980e3da76b9977443f96c599","last_reissued_at":"2026-07-05T09:01:02.689131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:01:02.689131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentiability and Optimization of Multiparameter Persistent Homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.OC"],"primary_cat":"cs.CG","authors_text":"David Loiseaux, Luis Scoccola, Mathieu Carri\\`ere, Siddharth Setlur, Steve Oudot","submitted_at":"2024-06-11T13:03:43Z","abstract_excerpt":"Real-valued functions on geometric data -- such as node attributes on a graph -- can be optimized using descriptors from persistent homology, allowing the user to incorporate topological terms in the loss function. When optimizing a single real-valued function (the one-parameter setting), there is a canonical choice of descriptor for persistent homology: the barcode. The operation mapping a real-valued function to its barcode is differentiable almost everywhere, and the convergence of gradient descent for losses using barcodes is relatively well understood. When optimizing a vector-valued func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07224","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/2406.07224/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":"2406.07224","created_at":"2026-07-05T09:01:02.689184+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.07224v2","created_at":"2026-07-05T09:01:02.689184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07224","created_at":"2026-07-05T09:01:02.689184+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HGDAXHY2SNL","created_at":"2026-07-05T09:01:02.689184+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HGDAXHY2SNLMHEW","created_at":"2026-07-05T09:01:02.689184+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HGDAXHY","created_at":"2026-07-05T09:01:02.689184+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.18696","citing_title":"STITCH: Surface reconstrucTion using Implicit neural representations with Topology Constraints and persistent Homology","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5HGDAXHY2SNLMHEWZHPS4II44I","json":"https://pith.science/pith/5HGDAXHY2SNLMHEWZHPS4II44I.json","graph_json":"https://pith.science/api/pith-number/5HGDAXHY2SNLMHEWZHPS4II44I/graph.json","events_json":"https://pith.science/api/pith-number/5HGDAXHY2SNLMHEWZHPS4II44I/events.json","paper":"https://pith.science/paper/5HGDAXHY"},"agent_actions":{"view_html":"https://pith.science/pith/5HGDAXHY2SNLMHEWZHPS4II44I","download_json":"https://pith.science/pith/5HGDAXHY2SNLMHEWZHPS4II44I.json","view_paper":"https://pith.science/paper/5HGDAXHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.07224&json=true","fetch_graph":"https://pith.science/api/pith-number/5HGDAXHY2SNLMHEWZHPS4II44I/graph.json","fetch_events":"https://pith.science/api/pith-number/5HGDAXHY2SNLMHEWZHPS4II44I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HGDAXHY2SNLMHEWZHPS4II44I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HGDAXHY2SNLMHEWZHPS4II44I/action/storage_attestation","attest_author":"https://pith.science/pith/5HGDAXHY2SNLMHEWZHPS4II44I/action/author_attestation","sign_citation":"https://pith.science/pith/5HGDAXHY2SNLMHEWZHPS4II44I/action/citation_signature","submit_replication":"https://pith.science/pith/5HGDAXHY2SNLMHEWZHPS4II44I/action/replication_record"}},"created_at":"2026-07-05T09:01:02.689184+00:00","updated_at":"2026-07-05T09:01:02.689184+00:00"}