{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IFU64LOFHDAPMGDCJ5NTOCJES4","short_pith_number":"pith:IFU64LOF","schema_version":"1.0","canonical_sha256":"4169ee2dc538c0f618624f5b370924973f615793bd43bafd5c21cd35cc597ca8","source":{"kind":"arxiv","id":"1908.11034","version":1},"attestation_state":"computed","paper":{"title":"Carving-width and contraction trees for tensor networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cond-mat.str-el","quant-ph"],"primary_cat":"cs.DM","authors_text":"D. Anekstein, J. Jakes-Schauer, P. Wocjan","submitted_at":"2019-08-29T03:32:48Z","abstract_excerpt":"We study the problem of finding contraction orderings on tensor networks for physical simulations using a syncretic abstract data type, the $\\textit{contraction-tree}$, and explain its connection to temporal and spatial measures of tensor contraction computational complexity (nodes express time; arcs express space). We have implemented the Ratcatcher of Seymour and Thomas for determining the carving-width of planar networks, in order to offer experimental evidence that this measure of spatial complexity makes a generally effective heuristic for limiting their total contraction time."},"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":"1908.11034","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2019-08-29T03:32:48Z","cross_cats_sorted":["cond-mat.str-el","quant-ph"],"title_canon_sha256":"8f7bdb42540e59bc11984f6c0e9ff8d3877c30a11af7bb5798fae111a2a25387","abstract_canon_sha256":"82e1a618122c2b56059bcfecf59c04ac4be26aca6c788953b4e9208274b601d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:29.576868Z","signature_b64":"MG2sYqohm3E/3UAu5Nnx8s7sNtXq1sywsobGHKj1aO7qkTE5Mnx+0kqoNq3E9XSsjuA+SrYkMuYmpa3LGdttAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4169ee2dc538c0f618624f5b370924973f615793bd43bafd5c21cd35cc597ca8","last_reissued_at":"2026-07-05T00:00:29.576406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:29.576406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Carving-width and contraction trees for tensor networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cond-mat.str-el","quant-ph"],"primary_cat":"cs.DM","authors_text":"D. Anekstein, J. Jakes-Schauer, P. Wocjan","submitted_at":"2019-08-29T03:32:48Z","abstract_excerpt":"We study the problem of finding contraction orderings on tensor networks for physical simulations using a syncretic abstract data type, the $\\textit{contraction-tree}$, and explain its connection to temporal and spatial measures of tensor contraction computational complexity (nodes express time; arcs express space). We have implemented the Ratcatcher of Seymour and Thomas for determining the carving-width of planar networks, in order to offer experimental evidence that this measure of spatial complexity makes a generally effective heuristic for limiting their total contraction time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11034","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/1908.11034/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":"1908.11034","created_at":"2026-07-05T00:00:29.576469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.11034v1","created_at":"2026-07-05T00:00:29.576469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11034","created_at":"2026-07-05T00:00:29.576469+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFU64LOFHDAP","created_at":"2026-07-05T00:00:29.576469+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFU64LOFHDAPMGDC","created_at":"2026-07-05T00:00:29.576469+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFU64LOF","created_at":"2026-07-05T00:00:29.576469+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.02725","citing_title":"Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFU64LOFHDAPMGDCJ5NTOCJES4","json":"https://pith.science/pith/IFU64LOFHDAPMGDCJ5NTOCJES4.json","graph_json":"https://pith.science/api/pith-number/IFU64LOFHDAPMGDCJ5NTOCJES4/graph.json","events_json":"https://pith.science/api/pith-number/IFU64LOFHDAPMGDCJ5NTOCJES4/events.json","paper":"https://pith.science/paper/IFU64LOF"},"agent_actions":{"view_html":"https://pith.science/pith/IFU64LOFHDAPMGDCJ5NTOCJES4","download_json":"https://pith.science/pith/IFU64LOFHDAPMGDCJ5NTOCJES4.json","view_paper":"https://pith.science/paper/IFU64LOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.11034&json=true","fetch_graph":"https://pith.science/api/pith-number/IFU64LOFHDAPMGDCJ5NTOCJES4/graph.json","fetch_events":"https://pith.science/api/pith-number/IFU64LOFHDAPMGDCJ5NTOCJES4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFU64LOFHDAPMGDCJ5NTOCJES4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFU64LOFHDAPMGDCJ5NTOCJES4/action/storage_attestation","attest_author":"https://pith.science/pith/IFU64LOFHDAPMGDCJ5NTOCJES4/action/author_attestation","sign_citation":"https://pith.science/pith/IFU64LOFHDAPMGDCJ5NTOCJES4/action/citation_signature","submit_replication":"https://pith.science/pith/IFU64LOFHDAPMGDCJ5NTOCJES4/action/replication_record"}},"created_at":"2026-07-05T00:00:29.576469+00:00","updated_at":"2026-07-05T00:00:29.576469+00:00"}