{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TXJO5NKMZIQDZE4L3NJZZDBQMC","short_pith_number":"pith:TXJO5NKM","schema_version":"1.0","canonical_sha256":"9dd2eeb54cca203c938bdb539c8c30609bbd83a520def4b6477ce40386ab8d22","source":{"kind":"arxiv","id":"2408.03418","version":2},"attestation_state":"computed","paper":{"title":"Detecting Quantum and Classical Phase Transitions via Unsupervised Machine Learning of the Fisher Information Metric","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Lidar, Evgeny Mozgunov, Nicholas Ezzell, Victor Kasatkin","submitted_at":"2024-08-06T19:34:04Z","abstract_excerpt":"The detection of quantum and classical phase transitions in the absence of an order parameter is possible using the Fisher information metric (FIM), also known as fidelity susceptibility. Here, we propose and investigate an unsupervised machine learning (ML) task: estimating the FIM given limited samples from a multivariate probability distribution of measurements made throughout the phase diagram. We utilize an unsupervised ML method called ClassiFIM (developed in a companion paper) to solve this task and demonstrate its empirical effectiveness in detecting both quantum and classical phase tr"},"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":"2408.03418","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-06T19:34:04Z","cross_cats_sorted":[],"title_canon_sha256":"556617ad9d9ce850452c514798c92c291360a2174a930f0185c302357815ad2a","abstract_canon_sha256":"6af739fccfdec6afd738026455e070fd10a19f3d3342391d5a3dbde616f43643"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:11.284122Z","signature_b64":"bjk44KcWxFxnu9r51xFTgHUdGbvv+KOc+j8Vc6sKz3D7Io39lUGSol6gDON2Gwsoj3scSWzhhrtw0FdihQg9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dd2eeb54cca203c938bdb539c8c30609bbd83a520def4b6477ce40386ab8d22","last_reissued_at":"2026-07-05T08:59:11.283663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:11.283663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting Quantum and Classical Phase Transitions via Unsupervised Machine Learning of the Fisher Information Metric","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Lidar, Evgeny Mozgunov, Nicholas Ezzell, Victor Kasatkin","submitted_at":"2024-08-06T19:34:04Z","abstract_excerpt":"The detection of quantum and classical phase transitions in the absence of an order parameter is possible using the Fisher information metric (FIM), also known as fidelity susceptibility. Here, we propose and investigate an unsupervised machine learning (ML) task: estimating the FIM given limited samples from a multivariate probability distribution of measurements made throughout the phase diagram. We utilize an unsupervised ML method called ClassiFIM (developed in a companion paper) to solve this task and demonstrate its empirical effectiveness in detecting both quantum and classical phase tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03418","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/2408.03418/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":"2408.03418","created_at":"2026-07-05T08:59:11.283719+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03418v2","created_at":"2026-07-05T08:59:11.283719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03418","created_at":"2026-07-05T08:59:11.283719+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXJO5NKMZIQD","created_at":"2026-07-05T08:59:11.283719+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXJO5NKMZIQDZE4L","created_at":"2026-07-05T08:59:11.283719+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXJO5NKM","created_at":"2026-07-05T08:59:11.283719+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17470","citing_title":"Demonstration of Efficient Predictive Surrogates for Large-scale Quantum Processors","ref_index":136,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TXJO5NKMZIQDZE4L3NJZZDBQMC","json":"https://pith.science/pith/TXJO5NKMZIQDZE4L3NJZZDBQMC.json","graph_json":"https://pith.science/api/pith-number/TXJO5NKMZIQDZE4L3NJZZDBQMC/graph.json","events_json":"https://pith.science/api/pith-number/TXJO5NKMZIQDZE4L3NJZZDBQMC/events.json","paper":"https://pith.science/paper/TXJO5NKM"},"agent_actions":{"view_html":"https://pith.science/pith/TXJO5NKMZIQDZE4L3NJZZDBQMC","download_json":"https://pith.science/pith/TXJO5NKMZIQDZE4L3NJZZDBQMC.json","view_paper":"https://pith.science/paper/TXJO5NKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03418&json=true","fetch_graph":"https://pith.science/api/pith-number/TXJO5NKMZIQDZE4L3NJZZDBQMC/graph.json","fetch_events":"https://pith.science/api/pith-number/TXJO5NKMZIQDZE4L3NJZZDBQMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXJO5NKMZIQDZE4L3NJZZDBQMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXJO5NKMZIQDZE4L3NJZZDBQMC/action/storage_attestation","attest_author":"https://pith.science/pith/TXJO5NKMZIQDZE4L3NJZZDBQMC/action/author_attestation","sign_citation":"https://pith.science/pith/TXJO5NKMZIQDZE4L3NJZZDBQMC/action/citation_signature","submit_replication":"https://pith.science/pith/TXJO5NKMZIQDZE4L3NJZZDBQMC/action/replication_record"}},"created_at":"2026-07-05T08:59:11.283719+00:00","updated_at":"2026-07-05T08:59:11.283719+00:00"}