{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ADE7KNXWCCGCG4P4624YWZ3UWM","short_pith_number":"pith:ADE7KNXW","schema_version":"1.0","canonical_sha256":"00c9f536f6108c2371fcf6b98b6774b33a8a28ec85c2dac77197af7d626650fb","source":{"kind":"arxiv","id":"2509.09813","version":1},"attestation_state":"computed","paper":{"title":"Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Amira Abbas, Dmitry Grinko, Francesco Anna Mele, Francisco Escudero Guti\\'errez, Nunzia Cerrato, Pulkit Sinha","submitted_at":"2025-09-11T19:32:55Z","abstract_excerpt":"We study the problem of learning Hamiltonians $H$ that are $s$-sparse in the Pauli basis, given access to their time evolution. Although Hamiltonian learning has been extensively investigated, two issues recur in much of the existing literature: the absence of matching lower bounds and the use of mathematically convenient but physically opaque error measures.\n  We address both challenges by introducing two physically motivated distances between Hamiltonians and designing a nearly optimal algorithm with respect to one of these metrics. The first, time-constrained distance, quantifies distinguis"},"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":"2509.09813","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-11T19:32:55Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"8a8d6d14f42a0d6778430cfb22aee04681548cd49304a2d6f4936a5b13666aca","abstract_canon_sha256":"74d90b7652d479e6cf17c4ea070a3dbe5b6889145908fdd4ea27dbe35244aa7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:49.838495Z","signature_b64":"tXZY3aAtlWPWJe+/EZVcUWZjKaJBdilgrzCApHzn92lxbtR7cfJrhmH8hyNuER0yaLuhmWfSd9YUDyCYIXK/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00c9f536f6108c2371fcf6b98b6774b33a8a28ec85c2dac77197af7d626650fb","last_reissued_at":"2026-07-05T12:09:49.837994Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:49.837994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Amira Abbas, Dmitry Grinko, Francesco Anna Mele, Francisco Escudero Guti\\'errez, Nunzia Cerrato, Pulkit Sinha","submitted_at":"2025-09-11T19:32:55Z","abstract_excerpt":"We study the problem of learning Hamiltonians $H$ that are $s$-sparse in the Pauli basis, given access to their time evolution. Although Hamiltonian learning has been extensively investigated, two issues recur in much of the existing literature: the absence of matching lower bounds and the use of mathematically convenient but physically opaque error measures.\n  We address both challenges by introducing two physically motivated distances between Hamiltonians and designing a nearly optimal algorithm with respect to one of these metrics. The first, time-constrained distance, quantifies distinguis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09813","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/2509.09813/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":"2509.09813","created_at":"2026-07-05T12:09:49.838048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.09813v1","created_at":"2026-07-05T12:09:49.838048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09813","created_at":"2026-07-05T12:09:49.838048+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADE7KNXWCCGC","created_at":"2026-07-05T12:09:49.838048+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADE7KNXWCCGCG4P4","created_at":"2026-07-05T12:09:49.838048+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADE7KNXW","created_at":"2026-07-05T12:09:49.838048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06472","citing_title":"Provable learning separation for predicting time-evolution of quantum many-body systems","ref_index":92,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27838","citing_title":"Heisenberg-limited Hamiltonian learning without short-time control","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ADE7KNXWCCGCG4P4624YWZ3UWM","json":"https://pith.science/pith/ADE7KNXWCCGCG4P4624YWZ3UWM.json","graph_json":"https://pith.science/api/pith-number/ADE7KNXWCCGCG4P4624YWZ3UWM/graph.json","events_json":"https://pith.science/api/pith-number/ADE7KNXWCCGCG4P4624YWZ3UWM/events.json","paper":"https://pith.science/paper/ADE7KNXW"},"agent_actions":{"view_html":"https://pith.science/pith/ADE7KNXWCCGCG4P4624YWZ3UWM","download_json":"https://pith.science/pith/ADE7KNXWCCGCG4P4624YWZ3UWM.json","view_paper":"https://pith.science/paper/ADE7KNXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.09813&json=true","fetch_graph":"https://pith.science/api/pith-number/ADE7KNXWCCGCG4P4624YWZ3UWM/graph.json","fetch_events":"https://pith.science/api/pith-number/ADE7KNXWCCGCG4P4624YWZ3UWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADE7KNXWCCGCG4P4624YWZ3UWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADE7KNXWCCGCG4P4624YWZ3UWM/action/storage_attestation","attest_author":"https://pith.science/pith/ADE7KNXWCCGCG4P4624YWZ3UWM/action/author_attestation","sign_citation":"https://pith.science/pith/ADE7KNXWCCGCG4P4624YWZ3UWM/action/citation_signature","submit_replication":"https://pith.science/pith/ADE7KNXWCCGCG4P4624YWZ3UWM/action/replication_record"}},"created_at":"2026-07-05T12:09:49.838048+00:00","updated_at":"2026-07-05T12:09:49.838048+00:00"}