{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UYIFENVOIA2RAT4GUR7KY7VEYR","short_pith_number":"pith:UYIFENVO","schema_version":"1.0","canonical_sha256":"a6105236ae4035104f86a47eac7ea4c44cea38766f7b64533db39d84d9be9d46","source":{"kind":"arxiv","id":"2311.09128","version":1},"attestation_state":"computed","paper":{"title":"Fast Detection of Phase Transitions with Multi-Task Learning-by-Confusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"cs.LG","authors_text":"Frank Sch\\\"afer, Julian Arnold, Niels L\\\"orch","submitted_at":"2023-11-15T17:17:49Z","abstract_excerpt":"Machine learning has been successfully used to study phase transitions. One of the most popular approaches to identifying critical points from data without prior knowledge of the underlying phases is the learning-by-confusion scheme. As input, it requires system samples drawn from a grid of the parameter whose change is associated with potential phase transitions. Up to now, the scheme required training a distinct binary classifier for each possible splitting of the grid into two sides, resulting in a computational cost that scales linearly with the number of grid points. In this work, we prop"},"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":"2311.09128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-15T17:17:49Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"205ea5d86bb67cc907b304aa398a88dd26bc80b33b6dc2946ccc684c66f93be6","abstract_canon_sha256":"191fb39f965b8d44d68ae7ebf3c6c4b5e7b046380b245022c39ea371c5a0d54e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:09.267383Z","signature_b64":"bFYhSTHuiiB5cgwhVrhl4yv3FPZ4o6lf5E38/XLS+xrp4UabCfjmPiv+eIv4RRR+E8OHfKl/oy2RJnFgk7SEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6105236ae4035104f86a47eac7ea4c44cea38766f7b64533db39d84d9be9d46","last_reissued_at":"2026-07-05T07:13:09.266966Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:09.266966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Detection of Phase Transitions with Multi-Task Learning-by-Confusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"cs.LG","authors_text":"Frank Sch\\\"afer, Julian Arnold, Niels L\\\"orch","submitted_at":"2023-11-15T17:17:49Z","abstract_excerpt":"Machine learning has been successfully used to study phase transitions. One of the most popular approaches to identifying critical points from data without prior knowledge of the underlying phases is the learning-by-confusion scheme. As input, it requires system samples drawn from a grid of the parameter whose change is associated with potential phase transitions. Up to now, the scheme required training a distinct binary classifier for each possible splitting of the grid into two sides, resulting in a computational cost that scales linearly with the number of grid points. In this work, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09128","kind":"arxiv","version":1},"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/2311.09128/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":"2311.09128","created_at":"2026-07-05T07:13:09.267021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.09128v1","created_at":"2026-07-05T07:13:09.267021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09128","created_at":"2026-07-05T07:13:09.267021+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYIFENVOIA2R","created_at":"2026-07-05T07:13:09.267021+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYIFENVOIA2RAT4G","created_at":"2026-07-05T07:13:09.267021+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYIFENVO","created_at":"2026-07-05T07:13:09.267021+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04681","citing_title":"Learning by Confusion: The Phase Diagram of the Holstein Model","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UYIFENVOIA2RAT4GUR7KY7VEYR","json":"https://pith.science/pith/UYIFENVOIA2RAT4GUR7KY7VEYR.json","graph_json":"https://pith.science/api/pith-number/UYIFENVOIA2RAT4GUR7KY7VEYR/graph.json","events_json":"https://pith.science/api/pith-number/UYIFENVOIA2RAT4GUR7KY7VEYR/events.json","paper":"https://pith.science/paper/UYIFENVO"},"agent_actions":{"view_html":"https://pith.science/pith/UYIFENVOIA2RAT4GUR7KY7VEYR","download_json":"https://pith.science/pith/UYIFENVOIA2RAT4GUR7KY7VEYR.json","view_paper":"https://pith.science/paper/UYIFENVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.09128&json=true","fetch_graph":"https://pith.science/api/pith-number/UYIFENVOIA2RAT4GUR7KY7VEYR/graph.json","fetch_events":"https://pith.science/api/pith-number/UYIFENVOIA2RAT4GUR7KY7VEYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYIFENVOIA2RAT4GUR7KY7VEYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYIFENVOIA2RAT4GUR7KY7VEYR/action/storage_attestation","attest_author":"https://pith.science/pith/UYIFENVOIA2RAT4GUR7KY7VEYR/action/author_attestation","sign_citation":"https://pith.science/pith/UYIFENVOIA2RAT4GUR7KY7VEYR/action/citation_signature","submit_replication":"https://pith.science/pith/UYIFENVOIA2RAT4GUR7KY7VEYR/action/replication_record"}},"created_at":"2026-07-05T07:13:09.267021+00:00","updated_at":"2026-07-05T07:13:09.267021+00:00"}