{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Y35QXDLJODKB5FG7AV7XUOQPIO","short_pith_number":"pith:Y35QXDLJ","schema_version":"1.0","canonical_sha256":"c6fb0b8d6970d41e94df057f7a3a0f43b9fe99766d4747082953ea869b15f23b","source":{"kind":"arxiv","id":"2209.02895","version":1},"attestation_state":"computed","paper":{"title":"Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Cameron Ibrahim, Danylo Lykov, Ilya Safro, Yuri Alexeev, Zichang He","submitted_at":"2022-09-07T02:50:30Z","abstract_excerpt":"One of the key problems in tensor network based quantum circuit simulation is the construction of a contraction tree which minimizes the cost of the simulation, where the cost can be expressed in the number of operations as a proxy for the simulation running time. This same problem arises in a variety of application areas, such as combinatorial scientific computing, marginalization in probabilistic graphical models, and solving constraint satisfaction problems. In this paper, we reduce the computationally hard portion of this problem to one of graph linear ordering, and demonstrate how existin"},"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":"2209.02895","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2022-09-07T02:50:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d26b42e92a9207ea771026d02c8f7a94420d73ac7a15511c518407bcafe50ad2","abstract_canon_sha256":"bad386b58c0854e6cdafebbd501ba7993b3f68696aa0428cbf47bae61ae80ba7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:21.129402Z","signature_b64":"Zn6aiVNQt5DwxKwnIknGtQUQSivSXPNoTTQxuzXZCuLchilzqePUn4pzZbhWfZDbe7S3S/nWLDcXsiBBU256Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6fb0b8d6970d41e94df057f7a3a0f43b9fe99766d4747082953ea869b15f23b","last_reissued_at":"2026-07-05T04:55:21.129010Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:21.129010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Cameron Ibrahim, Danylo Lykov, Ilya Safro, Yuri Alexeev, Zichang He","submitted_at":"2022-09-07T02:50:30Z","abstract_excerpt":"One of the key problems in tensor network based quantum circuit simulation is the construction of a contraction tree which minimizes the cost of the simulation, where the cost can be expressed in the number of operations as a proxy for the simulation running time. This same problem arises in a variety of application areas, such as combinatorial scientific computing, marginalization in probabilistic graphical models, and solving constraint satisfaction problems. In this paper, we reduce the computationally hard portion of this problem to one of graph linear ordering, and demonstrate how existin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.02895","kind":"arxiv","version":1},"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/2209.02895/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":"2209.02895","created_at":"2026-07-05T04:55:21.129066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.02895v1","created_at":"2026-07-05T04:55:21.129066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.02895","created_at":"2026-07-05T04:55:21.129066+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y35QXDLJODKB","created_at":"2026-07-05T04:55:21.129066+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y35QXDLJODKB5FG7","created_at":"2026-07-05T04:55:21.129066+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y35QXDLJ","created_at":"2026-07-05T04:55:21.129066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01975","citing_title":"Algorithmic algorithm development with LLMs: A Case Study on LLM-Usage for Contraction Order Optimization in Tensor Networks","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y35QXDLJODKB5FG7AV7XUOQPIO","json":"https://pith.science/pith/Y35QXDLJODKB5FG7AV7XUOQPIO.json","graph_json":"https://pith.science/api/pith-number/Y35QXDLJODKB5FG7AV7XUOQPIO/graph.json","events_json":"https://pith.science/api/pith-number/Y35QXDLJODKB5FG7AV7XUOQPIO/events.json","paper":"https://pith.science/paper/Y35QXDLJ"},"agent_actions":{"view_html":"https://pith.science/pith/Y35QXDLJODKB5FG7AV7XUOQPIO","download_json":"https://pith.science/pith/Y35QXDLJODKB5FG7AV7XUOQPIO.json","view_paper":"https://pith.science/paper/Y35QXDLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.02895&json=true","fetch_graph":"https://pith.science/api/pith-number/Y35QXDLJODKB5FG7AV7XUOQPIO/graph.json","fetch_events":"https://pith.science/api/pith-number/Y35QXDLJODKB5FG7AV7XUOQPIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y35QXDLJODKB5FG7AV7XUOQPIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y35QXDLJODKB5FG7AV7XUOQPIO/action/storage_attestation","attest_author":"https://pith.science/pith/Y35QXDLJODKB5FG7AV7XUOQPIO/action/author_attestation","sign_citation":"https://pith.science/pith/Y35QXDLJODKB5FG7AV7XUOQPIO/action/citation_signature","submit_replication":"https://pith.science/pith/Y35QXDLJODKB5FG7AV7XUOQPIO/action/replication_record"}},"created_at":"2026-07-05T04:55:21.129066+00:00","updated_at":"2026-07-05T04:55:21.129066+00:00"}