{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KDL426CAUT3ZI534VKJCM7XV4C","short_pith_number":"pith:KDL426CA","canonical_record":{"source":{"id":"1709.07460","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2017-09-21T18:00:11Z","cross_cats_sorted":["cond-mat.stat-mech","hep-th","quant-ph"],"title_canon_sha256":"bb8779fda656dd184e99579b08d363ce213f92ab48ffbb7e2caa094c22b5726c","abstract_canon_sha256":"3a32ed8fe67cba51ec69b6e5908586dbd3898a16b0b240936d98e922b47a8d38"},"schema_version":"1.0"},"canonical_sha256":"50d7cd7840a4f794777caa92267ef5e0921118db4db03e676193d084b904b784","source":{"kind":"arxiv","id":"1709.07460","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07460","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07460v2","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07460","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"KDL426CAUT3Z","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KDL426CAUT3ZI534","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KDL426CA","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KDL426CAUT3ZI534VKJCM7XV4C","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07460","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2017-09-21T18:00:11Z","cross_cats_sorted":["cond-mat.stat-mech","hep-th","quant-ph"],"title_canon_sha256":"bb8779fda656dd184e99579b08d363ce213f92ab48ffbb7e2caa094c22b5726c","abstract_canon_sha256":"3a32ed8fe67cba51ec69b6e5908586dbd3898a16b0b240936d98e922b47a8d38"},"schema_version":"1.0"},"canonical_sha256":"50d7cd7840a4f794777caa92267ef5e0921118db4db03e676193d084b904b784","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:33.020852Z","signature_b64":"1RslHgPbH9AnDcz/GHcUiJcQJYnHKPxJ6JyFdy7FFMVqNgBjp6NHE4X5sz4JmGFssIukwfnzX2svHCock8DiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50d7cd7840a4f794777caa92267ef5e0921118db4db03e676193d084b904b784","last_reissued_at":"2026-05-18T00:07:33.020256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:33.020256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07460","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-18T00:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQIhsGfF3XNq+HDNlvgMYi6w0rkL1koKNn/XaWfdAaSh8ft3xKFn4wNh0y0ZmBdk5FXW6ga6mjVIa+fCvNIxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:40:31.129254Z"},"content_sha256":"4c84fad9c3b3ce2bdb058126655f9880e963af3c2a7828a1af5268120936e3f6","schema_version":"1.0","event_id":"sha256:4c84fad9c3b3ce2bdb058126655f9880e963af3c2a7828a1af5268120936e3f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KDL426CAUT3ZI534VKJCM7XV4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Renormalization of tensor networks using graph independent local truncations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","hep-th","quant-ph"],"primary_cat":"cond-mat.str-el","authors_text":"Clement Delcamp, Markus Hauru, Sebastian Mizera","submitted_at":"2017-09-21T18:00:11Z","abstract_excerpt":"We introduce an efficient algorithm for reducing bond dimensions in an arbitrary tensor network without changing its geometry. The method is based on a novel, quantitative understanding of local correlations in a network. Together with a tensor network coarse-graining algorithm, it yields a proper renormalization group (RG) flow. Compared to existing methods, the advantages of our algorithm are its low computational cost, simplicity of implementation, and applicability to any network. We benchmark it by evaluating physical observables for the 2D classical Ising model and find accuracy comparab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07460","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-18T00:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REwoOp/DOWPI8umO6rmkxWrvxqZMQSHbiIGvmb0NaHw4VKMq/Z/bVVbVy2trkiwUwUZ9EF13P98n2DlXPa8GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:40:31.129631Z"},"content_sha256":"17c3513a68d83ff18a6e8d4a3b3559bac398ede03080ad0cc3ee98131b92cf6f","schema_version":"1.0","event_id":"sha256:17c3513a68d83ff18a6e8d4a3b3559bac398ede03080ad0cc3ee98131b92cf6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDL426CAUT3ZI534VKJCM7XV4C/bundle.json","state_url":"https://pith.science/pith/KDL426CAUT3ZI534VKJCM7XV4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDL426CAUT3ZI534VKJCM7XV4C/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-22T19:40:31Z","links":{"resolver":"https://pith.science/pith/KDL426CAUT3ZI534VKJCM7XV4C","bundle":"https://pith.science/pith/KDL426CAUT3ZI534VKJCM7XV4C/bundle.json","state":"https://pith.science/pith/KDL426CAUT3ZI534VKJCM7XV4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDL426CAUT3ZI534VKJCM7XV4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KDL426CAUT3ZI534VKJCM7XV4C","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":"3a32ed8fe67cba51ec69b6e5908586dbd3898a16b0b240936d98e922b47a8d38","cross_cats_sorted":["cond-mat.stat-mech","hep-th","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2017-09-21T18:00:11Z","title_canon_sha256":"bb8779fda656dd184e99579b08d363ce213f92ab48ffbb7e2caa094c22b5726c"},"schema_version":"1.0","source":{"id":"1709.07460","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07460","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07460v2","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07460","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"KDL426CAUT3Z","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KDL426CAUT3ZI534","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KDL426CA","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:17c3513a68d83ff18a6e8d4a3b3559bac398ede03080ad0cc3ee98131b92cf6f","target":"graph","created_at":"2026-05-18T00:07:33Z","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 introduce an efficient algorithm for reducing bond dimensions in an arbitrary tensor network without changing its geometry. The method is based on a novel, quantitative understanding of local correlations in a network. Together with a tensor network coarse-graining algorithm, it yields a proper renormalization group (RG) flow. Compared to existing methods, the advantages of our algorithm are its low computational cost, simplicity of implementation, and applicability to any network. We benchmark it by evaluating physical observables for the 2D classical Ising model and find accuracy comparab","authors_text":"Clement Delcamp, Markus Hauru, Sebastian Mizera","cross_cats":["cond-mat.stat-mech","hep-th","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2017-09-21T18:00:11Z","title":"Renormalization of tensor networks using graph independent local truncations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07460","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:4c84fad9c3b3ce2bdb058126655f9880e963af3c2a7828a1af5268120936e3f6","target":"record","created_at":"2026-05-18T00:07:33Z","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":"3a32ed8fe67cba51ec69b6e5908586dbd3898a16b0b240936d98e922b47a8d38","cross_cats_sorted":["cond-mat.stat-mech","hep-th","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2017-09-21T18:00:11Z","title_canon_sha256":"bb8779fda656dd184e99579b08d363ce213f92ab48ffbb7e2caa094c22b5726c"},"schema_version":"1.0","source":{"id":"1709.07460","kind":"arxiv","version":2}},"canonical_sha256":"50d7cd7840a4f794777caa92267ef5e0921118db4db03e676193d084b904b784","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50d7cd7840a4f794777caa92267ef5e0921118db4db03e676193d084b904b784","first_computed_at":"2026-05-18T00:07:33.020256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:33.020256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1RslHgPbH9AnDcz/GHcUiJcQJYnHKPxJ6JyFdy7FFMVqNgBjp6NHE4X5sz4JmGFssIukwfnzX2svHCock8DiBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:33.020852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07460","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c84fad9c3b3ce2bdb058126655f9880e963af3c2a7828a1af5268120936e3f6","sha256:17c3513a68d83ff18a6e8d4a3b3559bac398ede03080ad0cc3ee98131b92cf6f"],"state_sha256":"6fc21c61a5570e4b93b935492f8e988c0b178453b6cabe5d368e702cb814fb52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+poblzLYMY0RDjW2CA8VW/71/Q32I7aWDrB4tZuWkXK54/iywsGsKYCAUcZw0H7UdyD1wW9O8cpTJDFeczFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T19:40:31.131626Z","bundle_sha256":"a2f14835131eca60cb548d68d59084885e9e6099e5398e8efbc4b1e22b59339c"}}