{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QJGOKECPTOOW2LX7FUGYVY33RH","short_pith_number":"pith:QJGOKECP","canonical_record":{"source":{"id":"1808.00680","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2018-08-02T06:05:41Z","cross_cats_sorted":[],"title_canon_sha256":"cc73c29c9243f67e878e364941d2df37207a9b7e54a252605caf48a2148aa416","abstract_canon_sha256":"60f334c4092be416d69c4d26d99f458eb0b01324dad9805cccd41369fc6de9df"},"schema_version":"1.0"},"canonical_sha256":"824ce5104f9b9d6d2eff2d0d8ae37b89edec15a4973081166937916bee4ef1a3","source":{"kind":"arxiv","id":"1808.00680","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00680","created_at":"2026-05-17T23:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00680v3","created_at":"2026-05-17T23:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00680","created_at":"2026-05-17T23:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"QJGOKECPTOOW","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJGOKECPTOOW2LX7","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJGOKECP","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QJGOKECPTOOW2LX7FUGYVY33RH","target":"record","payload":{"canonical_record":{"source":{"id":"1808.00680","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2018-08-02T06:05:41Z","cross_cats_sorted":[],"title_canon_sha256":"cc73c29c9243f67e878e364941d2df37207a9b7e54a252605caf48a2148aa416","abstract_canon_sha256":"60f334c4092be416d69c4d26d99f458eb0b01324dad9805cccd41369fc6de9df"},"schema_version":"1.0"},"canonical_sha256":"824ce5104f9b9d6d2eff2d0d8ae37b89edec15a4973081166937916bee4ef1a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:50.343976Z","signature_b64":"+lhS9xPRrsYXBMN/Em38U69GkkT/7FAbll1nMO0sUxACjWPUZOJ2x+CR5W1CHHWTMUEMLViQ33yEMt0BSptWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"824ce5104f9b9d6d2eff2d0d8ae37b89edec15a4973081166937916bee4ef1a3","last_reissued_at":"2026-05-17T23:46:50.343197Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:50.343197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.00680","source_version":3,"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-17T23:46:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"szadvavUtM5cAq9gfG3UYx1nmaOEpGrJSJ14ZoU3bHZkdiIm6UcT1i2/8id3rFeATHdBbfQtlvCQhmVDWcG/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:30:54.452036Z"},"content_sha256":"274b3484fa9a1777343d90457cd602588f836b51e73aec47110fcbc2c50cf253","schema_version":"1.0","event_id":"sha256:274b3484fa9a1777343d90457cd602588f836b51e73aec47110fcbc2c50cf253"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QJGOKECPTOOW2LX7FUGYVY33RH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A universal tensor network algorithm for any infinite lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.str-el","authors_text":"Roman Orus, Saeed S. Jahromi","submitted_at":"2018-08-02T06:05:41Z","abstract_excerpt":"We present a general graph-based Projected Entangled-Pair State (gPEPS) algorithm to approximate ground states of nearest-neighbor local Hamiltonians on any lattice or graph of infinite size. By introducing the structural-matrix which codifies the details of tensor networks on any graphs in any dimension $d$, we are able to produce a code that can be essentially launched to simulate any lattice. We further introduce an optimized algorithm to compute simple tensor updates as well as expectation values and correlators with a mean-field-like effective environments. Though not being variational, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00680","kind":"arxiv","version":3},"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-17T23:46:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTos6/GdQtsVlqTUFw10TdZ2kfUfnWalgseuHEKiK1KWKPj6ldK4N7BJhRSWolfTjLzUDCBPP6ir20naw9bwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:30:54.452683Z"},"content_sha256":"940b80ac1359db8368f944a55c6976c88be347e02c664fd0b3d87b8a5b91f313","schema_version":"1.0","event_id":"sha256:940b80ac1359db8368f944a55c6976c88be347e02c664fd0b3d87b8a5b91f313"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJGOKECPTOOW2LX7FUGYVY33RH/bundle.json","state_url":"https://pith.science/pith/QJGOKECPTOOW2LX7FUGYVY33RH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJGOKECPTOOW2LX7FUGYVY33RH/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-05-26T11:30:54Z","links":{"resolver":"https://pith.science/pith/QJGOKECPTOOW2LX7FUGYVY33RH","bundle":"https://pith.science/pith/QJGOKECPTOOW2LX7FUGYVY33RH/bundle.json","state":"https://pith.science/pith/QJGOKECPTOOW2LX7FUGYVY33RH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJGOKECPTOOW2LX7FUGYVY33RH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QJGOKECPTOOW2LX7FUGYVY33RH","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":"60f334c4092be416d69c4d26d99f458eb0b01324dad9805cccd41369fc6de9df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2018-08-02T06:05:41Z","title_canon_sha256":"cc73c29c9243f67e878e364941d2df37207a9b7e54a252605caf48a2148aa416"},"schema_version":"1.0","source":{"id":"1808.00680","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00680","created_at":"2026-05-17T23:46:50Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00680v3","created_at":"2026-05-17T23:46:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00680","created_at":"2026-05-17T23:46:50Z"},{"alias_kind":"pith_short_12","alias_value":"QJGOKECPTOOW","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJGOKECPTOOW2LX7","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJGOKECP","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:940b80ac1359db8368f944a55c6976c88be347e02c664fd0b3d87b8a5b91f313","target":"graph","created_at":"2026-05-17T23:46:50Z","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":"We present a general graph-based Projected Entangled-Pair State (gPEPS) algorithm to approximate ground states of nearest-neighbor local Hamiltonians on any lattice or graph of infinite size. By introducing the structural-matrix which codifies the details of tensor networks on any graphs in any dimension $d$, we are able to produce a code that can be essentially launched to simulate any lattice. We further introduce an optimized algorithm to compute simple tensor updates as well as expectation values and correlators with a mean-field-like effective environments. Though not being variational, t","authors_text":"Roman Orus, Saeed S. Jahromi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2018-08-02T06:05:41Z","title":"A universal tensor network algorithm for any infinite lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00680","kind":"arxiv","version":3},"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:274b3484fa9a1777343d90457cd602588f836b51e73aec47110fcbc2c50cf253","target":"record","created_at":"2026-05-17T23:46:50Z","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":"60f334c4092be416d69c4d26d99f458eb0b01324dad9805cccd41369fc6de9df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2018-08-02T06:05:41Z","title_canon_sha256":"cc73c29c9243f67e878e364941d2df37207a9b7e54a252605caf48a2148aa416"},"schema_version":"1.0","source":{"id":"1808.00680","kind":"arxiv","version":3}},"canonical_sha256":"824ce5104f9b9d6d2eff2d0d8ae37b89edec15a4973081166937916bee4ef1a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"824ce5104f9b9d6d2eff2d0d8ae37b89edec15a4973081166937916bee4ef1a3","first_computed_at":"2026-05-17T23:46:50.343197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:50.343197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+lhS9xPRrsYXBMN/Em38U69GkkT/7FAbll1nMO0sUxACjWPUZOJ2x+CR5W1CHHWTMUEMLViQ33yEMt0BSptWDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:50.343976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.00680","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:274b3484fa9a1777343d90457cd602588f836b51e73aec47110fcbc2c50cf253","sha256:940b80ac1359db8368f944a55c6976c88be347e02c664fd0b3d87b8a5b91f313"],"state_sha256":"ae0174d7b29a4ace75f228746f335ab665f707a03b38961ec499d04d976bae33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cj/j4pkTzoF4mqAav8VIg61SHLCAA9s0TGySi1ob5xrpVzlvq2cPPw+CCEVPUBc4DI31iWj0+UIVJsL7sLVhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:30:54.458621Z","bundle_sha256":"aa4831846aa9a199cbed8aecbcbd12dff556c169da5bc4835f384bdaf9eb16f8"}}