{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MBK6SIVZIEHZFJZEQ7XK2SKLWG","short_pith_number":"pith:MBK6SIVZ","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"},"canonical_sha256":"6055e922b9410f92a72487eead494bb1acc117a11db1ce02610cadf1502d0793","source":{"kind":"arxiv","id":"1411.0683","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0683","created_at":"2026-05-18T01:37:15Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0683v2","created_at":"2026-05-18T01:37:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0683","created_at":"2026-05-18T01:37:15Z"},{"alias_kind":"pith_short_12","alias_value":"MBK6SIVZIEHZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MBK6SIVZIEHZFJZE","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MBK6SIVZ","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MBK6SIVZIEHZFJZEQ7XK2SKLWG","target":"record","payload":{"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"},"canonical_sha256":"6055e922b9410f92a72487eead494bb1acc117a11db1ce02610cadf1502d0793","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"},"source_kind":"arxiv","source_id":"1411.0683","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rSg3MpZopu63tjN2OY4HwT3fOdAadtl5Xma8OCMuSuDnoPSsEKJxSov259L4DitFfIm48zMZbDEjEZxKNq0pCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:31:34.736866Z"},"content_sha256":"eb419fa2728153b161e2ec447af7d9e407eec9492a52b2ee6d9ce2bb0cbdc418","schema_version":"1.0","event_id":"sha256:eb419fa2728153b161e2ec447af7d9e407eec9492a52b2ee6d9ce2bb0cbdc418"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MBK6SIVZIEHZFJZEQ7XK2SKLWG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJSrDyxbuowGVZ0I67Hc0AXhn89EQSdQ1TRtgG5T29DYzWNqGsxC0/iLnTTJrHlMd6gzJyRd0cn+q5mB09D9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:31:34.737226Z"},"content_sha256":"147514ab71251cefe1a9dafe5e19a081a71ec27b6d370831b770f932da9888b2","schema_version":"1.0","event_id":"sha256:147514ab71251cefe1a9dafe5e19a081a71ec27b6d370831b770f932da9888b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/bundle.json","state_url":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T06:31:34Z","links":{"resolver":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG","bundle":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/bundle.json","state":"https://pith.science/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBK6SIVZIEHZFJZEQ7XK2SKLWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MBK6SIVZIEHZFJZEQ7XK2SKLWG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6b42547e45a29f112f4857acc432fc5459c6c462a1c4ff32a239696b965147e4","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2014-11-03T21:00:17Z","title_canon_sha256":"ed904c983e8239c902e6da77f75e0ded83964c95d2d95542d6c377b8edbb2749"},"schema_version":"1.0","source":{"id":"1411.0683","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0683","created_at":"2026-05-18T01:37:15Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0683v2","created_at":"2026-05-18T01:37:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0683","created_at":"2026-05-18T01:37:15Z"},{"alias_kind":"pith_short_12","alias_value":"MBK6SIVZIEHZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MBK6SIVZIEHZFJZE","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MBK6SIVZ","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:147514ab71251cefe1a9dafe5e19a081a71ec27b6d370831b770f932da9888b2","target":"graph","created_at":"2026-05-18T01:37:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Matthias Troyer, Mauro Iazzi","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2014-11-03T21:00:17Z","title":"Efficient continuous-time quantum Monte Carlo algorithm for fermionic lattice models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0683","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eb419fa2728153b161e2ec447af7d9e407eec9492a52b2ee6d9ce2bb0cbdc418","target":"record","created_at":"2026-05-18T01:37:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6b42547e45a29f112f4857acc432fc5459c6c462a1c4ff32a239696b965147e4","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2014-11-03T21:00:17Z","title_canon_sha256":"ed904c983e8239c902e6da77f75e0ded83964c95d2d95542d6c377b8edbb2749"},"schema_version":"1.0","source":{"id":"1411.0683","kind":"arxiv","version":2}},"canonical_sha256":"6055e922b9410f92a72487eead494bb1acc117a11db1ce02610cadf1502d0793","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6055e922b9410f92a72487eead494bb1acc117a11db1ce02610cadf1502d0793","first_computed_at":"2026-05-18T01:37:15.902241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:15.902241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D0aaA2Q7rT1hywsLocCnrZU0S5QNGBIIjPYeh6CEkwAtMT/D0JfCjIDEtGPRstj+7ySP3uUTPxshfR3NR2RcCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:15.902974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0683","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb419fa2728153b161e2ec447af7d9e407eec9492a52b2ee6d9ce2bb0cbdc418","sha256:147514ab71251cefe1a9dafe5e19a081a71ec27b6d370831b770f932da9888b2"],"state_sha256":"f07751d1b31cccc0335e17bcb873833a5cd4132c5c3f27335806bca2ffaed722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQIshXkQmdeUtMKiXl94K392nm2ny8b9/RMYJ0j5XBZMFldGiW1kjsJ/qTVap5Iys6fom9xao+O4Eg/yFiR8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T06:31:34.739427Z","bundle_sha256":"69d54911840817f735bd5afe6530557120091955ad9a3f793d279659c1497082"}}