{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QWYTD4XASNWRMFSBEQG2QXKMCE","short_pith_number":"pith:QWYTD4XA","schema_version":"1.0","canonical_sha256":"85b131f2e0936d161641240da85d4c110b7f8ccc9091f59adec5d97cc0f785ed","source":{"kind":"arxiv","id":"2206.07044","version":2},"attestation_state":"computed","paper":{"title":"Hyper-optimized approximate contraction of tensor networks with arbitrary geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Garnet Kin-Lic Chan, Johnnie Gray","submitted_at":"2022-06-14T17:59:16Z","abstract_excerpt":"Tensor network contraction is central to problems ranging from many-body physics to computer science. We describe how to approximate tensor network contraction through bond compression on arbitrary graphs. In particular, we introduce a hyper-optimization over the compression and contraction strategy itself to minimize error and cost. We demonstrate that our protocol outperforms both hand-crafted contraction strategies in the literature as well as recently proposed general contraction algorithms on a variety of synthetic and physical problems on regular lattices and random regular graphs. We fu"},"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":"2206.07044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-06-14T17:59:16Z","cross_cats_sorted":["cond-mat.stat-mech","cond-mat.str-el"],"title_canon_sha256":"5755deb0d5d4db5f6876202a3b124b1a66c9ca20c1b54e0ed2dbd0bac0bd962c","abstract_canon_sha256":"70950ad9f5811900f343313660e477b48f850d54519cce630d8f140df50770f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:06.824939Z","signature_b64":"CYJ3jY7BYsxh3GJ22Zmws25jlROCKh6Hdk6RcbXjiAa5eb520a/glQTqPH8PIBq8DLvuzTi6DHCy7ybCUbzQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85b131f2e0936d161641240da85d4c110b7f8ccc9091f59adec5d97cc0f785ed","last_reissued_at":"2026-07-05T07:38:06.824549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:06.824549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyper-optimized approximate contraction of tensor networks with arbitrary geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Garnet Kin-Lic Chan, Johnnie Gray","submitted_at":"2022-06-14T17:59:16Z","abstract_excerpt":"Tensor network contraction is central to problems ranging from many-body physics to computer science. We describe how to approximate tensor network contraction through bond compression on arbitrary graphs. In particular, we introduce a hyper-optimization over the compression and contraction strategy itself to minimize error and cost. We demonstrate that our protocol outperforms both hand-crafted contraction strategies in the literature as well as recently proposed general contraction algorithms on a variety of synthetic and physical problems on regular lattices and random regular graphs. We fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.07044","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.07044/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":"2206.07044","created_at":"2026-07-05T07:38:06.824602+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.07044v2","created_at":"2026-07-05T07:38:06.824602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.07044","created_at":"2026-07-05T07:38:06.824602+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWYTD4XASNWR","created_at":"2026-07-05T07:38:06.824602+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWYTD4XASNWRMFSB","created_at":"2026-07-05T07:38:06.824602+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWYTD4XA","created_at":"2026-07-05T07:38:06.824602+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.13739","citing_title":"Tensor-network decoders for process tensor descriptions of non-Markovian noise","ref_index":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QWYTD4XASNWRMFSBEQG2QXKMCE","json":"https://pith.science/pith/QWYTD4XASNWRMFSBEQG2QXKMCE.json","graph_json":"https://pith.science/api/pith-number/QWYTD4XASNWRMFSBEQG2QXKMCE/graph.json","events_json":"https://pith.science/api/pith-number/QWYTD4XASNWRMFSBEQG2QXKMCE/events.json","paper":"https://pith.science/paper/QWYTD4XA"},"agent_actions":{"view_html":"https://pith.science/pith/QWYTD4XASNWRMFSBEQG2QXKMCE","download_json":"https://pith.science/pith/QWYTD4XASNWRMFSBEQG2QXKMCE.json","view_paper":"https://pith.science/paper/QWYTD4XA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.07044&json=true","fetch_graph":"https://pith.science/api/pith-number/QWYTD4XASNWRMFSBEQG2QXKMCE/graph.json","fetch_events":"https://pith.science/api/pith-number/QWYTD4XASNWRMFSBEQG2QXKMCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWYTD4XASNWRMFSBEQG2QXKMCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWYTD4XASNWRMFSBEQG2QXKMCE/action/storage_attestation","attest_author":"https://pith.science/pith/QWYTD4XASNWRMFSBEQG2QXKMCE/action/author_attestation","sign_citation":"https://pith.science/pith/QWYTD4XASNWRMFSBEQG2QXKMCE/action/citation_signature","submit_replication":"https://pith.science/pith/QWYTD4XASNWRMFSBEQG2QXKMCE/action/replication_record"}},"created_at":"2026-07-05T07:38:06.824602+00:00","updated_at":"2026-07-05T07:38:06.824602+00:00"}