{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MBK6SIVZIEHZFJZEQ7XK2SKLWG","short_pith_number":"pith:MBK6SIVZ","schema_version":"1.0","canonical_sha256":"6055e922b9410f92a72487eead494bb1acc117a11db1ce02610cadf1502d0793","source":{"kind":"arxiv","id":"1411.0683","version":2},"attestation_state":"computed","paper":{"title":"Efficient continuous-time quantum Monte Carlo algorithm for fermionic lattice models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.str-el","authors_text":"Matthias Troyer, Mauro Iazzi","submitted_at":"2014-11-03T21:00:17Z","abstract_excerpt":"Efficient continuous time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state-of-the-art for most discrete quantum models. They have not been widely used yet for fermionic quantum lattice models, such as the Hubbard model, due to a suboptimal scaling of $O(\\beta^3)$ with inverse temperature $\\beta$, compared to the linear scaling of discrete time algorithms. Here we present a CT-QMC algorithms for fermionic lattice models that matches the scaling of discrete-time methods but is more efficient and free of time discretization errors. 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":"1411.0683","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2014-11-03T21:00:17Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"ed904c983e8239c902e6da77f75e0ded83964c95d2d95542d6c377b8edbb2749","abstract_canon_sha256":"6b42547e45a29f112f4857acc432fc5459c6c462a1c4ff32a239696b965147e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:15.902974Z","signature_b64":"D0aaA2Q7rT1hywsLocCnrZU0S5QNGBIIjPYeh6CEkwAtMT/D0JfCjIDEtGPRstj+7ySP3uUTPxshfR3NR2RcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6055e922b9410f92a72487eead494bb1acc117a11db1ce02610cadf1502d0793","last_reissued_at":"2026-05-18T01:37:15.902241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:15.902241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient continuous-time quantum Monte Carlo algorithm for fermionic lattice models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.str-el","authors_text":"Matthias Troyer, Mauro Iazzi","submitted_at":"2014-11-03T21:00:17Z","abstract_excerpt":"Efficient continuous time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state-of-the-art for most discrete quantum models. They have not been widely used yet for fermionic quantum lattice models, such as the Hubbard model, due to a suboptimal scaling of $O(\\beta^3)$ with inverse temperature $\\beta$, compared to the linear scaling of discrete time algorithms. Here we present a CT-QMC algorithms for fermionic lattice models that matches the scaling of discrete-time methods but is more efficient and free of time discretization errors. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0683","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":""},"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":"1411.0683","created_at":"2026-05-18T01:37:15.902376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0683v2","created_at":"2026-05-18T01:37:15.902376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0683","created_at":"2026-05-18T01:37:15.902376+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBK6SIVZIEHZ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBK6SIVZIEHZFJZE","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBK6SIVZ","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG","json":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG.json","graph_json":"https://pith.science/api/pith-number/MBK6SIVZIEHZFJZEQ7XK2SKLWG/graph.json","events_json":"https://pith.science/api/pith-number/MBK6SIVZIEHZFJZEQ7XK2SKLWG/events.json","paper":"https://pith.science/paper/MBK6SIVZ"},"agent_actions":{"view_html":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG","download_json":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG.json","view_paper":"https://pith.science/paper/MBK6SIVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0683&json=true","fetch_graph":"https://pith.science/api/pith-number/MBK6SIVZIEHZFJZEQ7XK2SKLWG/graph.json","fetch_events":"https://pith.science/api/pith-number/MBK6SIVZIEHZFJZEQ7XK2SKLWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/action/storage_attestation","attest_author":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/action/author_attestation","sign_citation":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/action/citation_signature","submit_replication":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/action/replication_record"}},"created_at":"2026-05-18T01:37:15.902376+00:00","updated_at":"2026-05-18T01:37:15.902376+00:00"}