{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3HRSH2IK2BBGUVZNFEN2WL46J2","short_pith_number":"pith:3HRSH2IK","schema_version":"1.0","canonical_sha256":"d9e323e90ad0426a572d291bab2f9e4e88b16de5d0c6d65e5311d09edc1f2014","source":{"kind":"arxiv","id":"1304.6112","version":7},"attestation_state":"computed","paper":{"title":"Faster identification of optimal contraction sequences for tensor networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph","quant-ph"],"primary_cat":"cond-mat.str-el","authors_text":"Frank Verstraete, Jutho Haegeman, Robert N. C. Pfeifer","submitted_at":"2013-04-22T21:48:47Z","abstract_excerpt":"The efficient evaluation of tensor expressions involving sums over multiple indices is of significant importance to many fields of research, including quantum many-body physics, loop quantum gravity, and quantum chemistry. The computational cost of evaluating an expression may depend strongly upon the order in which the index sums are evaluated, and determination of the operation-minimising contraction sequence for a single tensor network (single term, in quantum chemistry) is known to be NP-hard. The current preferred solution is an exhaustive search, using either an iterative depth-first app"},"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":"1304.6112","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2013-04-22T21:48:47Z","cross_cats_sorted":["physics.comp-ph","quant-ph"],"title_canon_sha256":"6d1f75ff2bf13eeb736e397c744b78ec4c2a7a20b6a86d4d6bb33c001c05e3d1","abstract_canon_sha256":"6b1a52cb3e862edc45965284b73824392fb9b156eadda330f6370ddba679371f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:49.193516Z","signature_b64":"MJyvvP1V2gbUF16B73HbRrnjBGKOXtTQg3ACpSKt/E/WYDF1lWvZgWH6TaOUZhKUf2Ov04eE3YvR4LGMV3nWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9e323e90ad0426a572d291bab2f9e4e88b16de5d0c6d65e5311d09edc1f2014","last_reissued_at":"2026-05-18T01:23:49.192830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:49.192830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster identification of optimal contraction sequences for tensor networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph","quant-ph"],"primary_cat":"cond-mat.str-el","authors_text":"Frank Verstraete, Jutho Haegeman, Robert N. C. Pfeifer","submitted_at":"2013-04-22T21:48:47Z","abstract_excerpt":"The efficient evaluation of tensor expressions involving sums over multiple indices is of significant importance to many fields of research, including quantum many-body physics, loop quantum gravity, and quantum chemistry. The computational cost of evaluating an expression may depend strongly upon the order in which the index sums are evaluated, and determination of the operation-minimising contraction sequence for a single tensor network (single term, in quantum chemistry) is known to be NP-hard. The current preferred solution is an exhaustive search, using either an iterative depth-first app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6112","kind":"arxiv","version":7},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.6112","created_at":"2026-05-18T01:23:49.192940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6112v7","created_at":"2026-05-18T01:23:49.192940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6112","created_at":"2026-05-18T01:23:49.192940+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HRSH2IK2BBG","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HRSH2IK2BBGUVZN","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HRSH2IK","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3HRSH2IK2BBGUVZNFEN2WL46J2","json":"https://pith.science/pith/3HRSH2IK2BBGUVZNFEN2WL46J2.json","graph_json":"https://pith.science/api/pith-number/3HRSH2IK2BBGUVZNFEN2WL46J2/graph.json","events_json":"https://pith.science/api/pith-number/3HRSH2IK2BBGUVZNFEN2WL46J2/events.json","paper":"https://pith.science/paper/3HRSH2IK"},"agent_actions":{"view_html":"https://pith.science/pith/3HRSH2IK2BBGUVZNFEN2WL46J2","download_json":"https://pith.science/pith/3HRSH2IK2BBGUVZNFEN2WL46J2.json","view_paper":"https://pith.science/paper/3HRSH2IK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6112&json=true","fetch_graph":"https://pith.science/api/pith-number/3HRSH2IK2BBGUVZNFEN2WL46J2/graph.json","fetch_events":"https://pith.science/api/pith-number/3HRSH2IK2BBGUVZNFEN2WL46J2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HRSH2IK2BBGUVZNFEN2WL46J2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HRSH2IK2BBGUVZNFEN2WL46J2/action/storage_attestation","attest_author":"https://pith.science/pith/3HRSH2IK2BBGUVZNFEN2WL46J2/action/author_attestation","sign_citation":"https://pith.science/pith/3HRSH2IK2BBGUVZNFEN2WL46J2/action/citation_signature","submit_replication":"https://pith.science/pith/3HRSH2IK2BBGUVZNFEN2WL46J2/action/replication_record"}},"created_at":"2026-05-18T01:23:49.192940+00:00","updated_at":"2026-05-18T01:23:49.192940+00:00"}