{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5KLWGRW5CV5LFO6MNKFTY6KLOG","short_pith_number":"pith:5KLWGRW5","schema_version":"1.0","canonical_sha256":"ea976346dd157ab2bbcc6a8b3c794b71a70f65b3d433dd816eb4ab6aa748cf33","source":{"kind":"arxiv","id":"2509.07937","version":1},"attestation_state":"computed","paper":{"title":"Improved Hamiltonian learning and sparsity testing through Bell sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Savar D. Sinha, Yu Tong","submitted_at":"2025-09-09T17:18:46Z","abstract_excerpt":"We consider the problem of learning an $M$-sparse Hamiltonian and the related problem of Hamiltonian sparsity testing. Through a detailed analysis of Bell sampling, we reduce the total evolution time required by the state-of-the-art algorithm for $M$-sparse Hamiltonian learning to $\\widetilde{\\mathcal{O}}(M/\\epsilon)$, where $\\epsilon$ denotes the $\\ell^{\\infty}$ error, achieving an improvement by a factor of $M$ (ignoring the logarithmic factor) while only requiring access to forward time-evolution. We then establish a connection between Hamiltonian learning and Hamiltonian sparsity testing t"},"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.07937","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-09T17:18:46Z","cross_cats_sorted":[],"title_canon_sha256":"6455014e00684792609cc8d455144d47b295447bf846a9d8aacf069656c70571","abstract_canon_sha256":"3fee6c1510dc048212346adc176519a48737b14c69425e50ab323bbc81751526"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:42.743477Z","signature_b64":"PdXKKyVvr1mDTN869OpayhT3f7UP0SFFBlnDEun/WvZIfF1wbnynB/mSL8POLaT/6bu4F83aK/QibTehuJWpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea976346dd157ab2bbcc6a8b3c794b71a70f65b3d433dd816eb4ab6aa748cf33","last_reissued_at":"2026-07-05T12:07:42.742994Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:42.742994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Hamiltonian learning and sparsity testing through Bell sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Savar D. Sinha, Yu Tong","submitted_at":"2025-09-09T17:18:46Z","abstract_excerpt":"We consider the problem of learning an $M$-sparse Hamiltonian and the related problem of Hamiltonian sparsity testing. Through a detailed analysis of Bell sampling, we reduce the total evolution time required by the state-of-the-art algorithm for $M$-sparse Hamiltonian learning to $\\widetilde{\\mathcal{O}}(M/\\epsilon)$, where $\\epsilon$ denotes the $\\ell^{\\infty}$ error, achieving an improvement by a factor of $M$ (ignoring the logarithmic factor) while only requiring access to forward time-evolution. We then establish a connection between Hamiltonian learning and Hamiltonian sparsity testing t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07937","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.07937/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.07937","created_at":"2026-07-05T12:07:42.743049+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.07937v1","created_at":"2026-07-05T12:07:42.743049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07937","created_at":"2026-07-05T12:07:42.743049+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KLWGRW5CV5L","created_at":"2026-07-05T12:07:42.743049+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KLWGRW5CV5LFO6M","created_at":"2026-07-05T12:07:42.743049+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KLWGRW5","created_at":"2026-07-05T12:07:42.743049+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"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":85,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20535","citing_title":"Near-Optimal Learning of Local Lindbladians","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19486","citing_title":"Optimal Ansatz-free Hamiltonian Learning In Situ","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20706","citing_title":"Efficient and SPAM-Robust Ansatz-Free Lindbladian Learning","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2509.20665","citing_title":"Lower Bounds for Learning Hamiltonians from Time Evolution","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2603.17736","citing_title":"Optimal detection of dissipation in Lindbladian dynamics","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5KLWGRW5CV5LFO6MNKFTY6KLOG","json":"https://pith.science/pith/5KLWGRW5CV5LFO6MNKFTY6KLOG.json","graph_json":"https://pith.science/api/pith-number/5KLWGRW5CV5LFO6MNKFTY6KLOG/graph.json","events_json":"https://pith.science/api/pith-number/5KLWGRW5CV5LFO6MNKFTY6KLOG/events.json","paper":"https://pith.science/paper/5KLWGRW5"},"agent_actions":{"view_html":"https://pith.science/pith/5KLWGRW5CV5LFO6MNKFTY6KLOG","download_json":"https://pith.science/pith/5KLWGRW5CV5LFO6MNKFTY6KLOG.json","view_paper":"https://pith.science/paper/5KLWGRW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.07937&json=true","fetch_graph":"https://pith.science/api/pith-number/5KLWGRW5CV5LFO6MNKFTY6KLOG/graph.json","fetch_events":"https://pith.science/api/pith-number/5KLWGRW5CV5LFO6MNKFTY6KLOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KLWGRW5CV5LFO6MNKFTY6KLOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KLWGRW5CV5LFO6MNKFTY6KLOG/action/storage_attestation","attest_author":"https://pith.science/pith/5KLWGRW5CV5LFO6MNKFTY6KLOG/action/author_attestation","sign_citation":"https://pith.science/pith/5KLWGRW5CV5LFO6MNKFTY6KLOG/action/citation_signature","submit_replication":"https://pith.science/pith/5KLWGRW5CV5LFO6MNKFTY6KLOG/action/replication_record"}},"created_at":"2026-07-05T12:07:42.743049+00:00","updated_at":"2026-07-05T12:07:42.743049+00:00"}