{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FTNE3NXDVTKU365AQWR2M3BN2Z","short_pith_number":"pith:FTNE3NXD","canonical_record":{"source":{"id":"2310.06140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-10-09T20:39:18Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fa385061cfa2e9c18527ef95eb94805d4448cc80465acaae493beb464a700b7c","abstract_canon_sha256":"54e76491ea1edbcde382bff8999a29fe12e6b479ceaa383f63322bbe467bd3cd"},"schema_version":"1.0"},"canonical_sha256":"2cda4db6e3acd54dfba085a3a66c2dd64b33fdaadc8f301667ac39b576049864","source":{"kind":"arxiv","id":"2310.06140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.06140","created_at":"2026-07-05T06:59:06Z"},{"alias_kind":"arxiv_version","alias_value":"2310.06140v1","created_at":"2026-07-05T06:59:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.06140","created_at":"2026-07-05T06:59:06Z"},{"alias_kind":"pith_short_12","alias_value":"FTNE3NXDVTKU","created_at":"2026-07-05T06:59:06Z"},{"alias_kind":"pith_short_16","alias_value":"FTNE3NXDVTKU365A","created_at":"2026-07-05T06:59:06Z"},{"alias_kind":"pith_short_8","alias_value":"FTNE3NXD","created_at":"2026-07-05T06:59:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FTNE3NXDVTKU365AQWR2M3BN2Z","target":"record","payload":{"canonical_record":{"source":{"id":"2310.06140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-10-09T20:39:18Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fa385061cfa2e9c18527ef95eb94805d4448cc80465acaae493beb464a700b7c","abstract_canon_sha256":"54e76491ea1edbcde382bff8999a29fe12e6b479ceaa383f63322bbe467bd3cd"},"schema_version":"1.0"},"canonical_sha256":"2cda4db6e3acd54dfba085a3a66c2dd64b33fdaadc8f301667ac39b576049864","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:59:06.086546Z","signature_b64":"uzp7Qv51xOrZFJErWq3AoYw8zBXlKrsSwKijFVpqaj881n3w/DIZ5sS3iPMRL2x1/IJFCYSronwXpPd5Cq1IBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cda4db6e3acd54dfba085a3a66c2dd64b33fdaadc8f301667ac39b576049864","last_reissued_at":"2026-07-05T06:59:06.086116Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:59:06.086116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.06140","source_version":1,"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-07-05T06:59:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0ingR/M8sscD3Kkp4UvygimOOtFTSqbm+XFAAbuEXhdxaQRS4giaHKyptm5s0hzJjSrxh+ekpC3MxRKf8a/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:55:50.215806Z"},"content_sha256":"5ee295f851080fb9134f74b4babc3f3749ebeef277ba92c7da1c58f47fdcab24","schema_version":"1.0","event_id":"sha256:5ee295f851080fb9134f74b4babc3f3749ebeef277ba92c7da1c58f47fdcab24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FTNE3NXDVTKU365AQWR2M3BN2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NP-Hardness of Tensor Network Contraction Ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Guoqi Li, Hanwen Zhang, Jianyu Xu, Lei Deng, Ling Liang, Yuan Xie","submitted_at":"2023-10-09T20:39:18Z","abstract_excerpt":"We study the optimal order (or sequence) of contracting a tensor network with a minimal computational cost. We conclude 2 different versions of this optimal sequence: that minimize the operation number (OMS) and that minimize the time complexity (CMS). Existing results only shows that OMS is NP-hard, but no conclusion on CMS problem. In this work, we firstly reduce CMS to CMS-0, which is a sub-problem of CMS with no free indices. Then we prove that CMS is easier than OMS, both in general and in tree cases. Last but not least, we prove that CMS is still NP-hard. Based on our results, we have bu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.06140","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/2310.06140/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"},"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-07-05T06:59:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LwGZUKmicCY5Ac9sSSrBG2N5D0PraqJZSWta1wTJ0qjE2lrqV4YLmsFnW/OlG1+sxYinDlnynvNui6K6iFnbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:55:50.216190Z"},"content_sha256":"63a7237700c9a4824f222789d4bec33eebd25b7c45fd7fbae327f1903ab331fe","schema_version":"1.0","event_id":"sha256:63a7237700c9a4824f222789d4bec33eebd25b7c45fd7fbae327f1903ab331fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTNE3NXDVTKU365AQWR2M3BN2Z/bundle.json","state_url":"https://pith.science/pith/FTNE3NXDVTKU365AQWR2M3BN2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTNE3NXDVTKU365AQWR2M3BN2Z/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-08-18T14:55:50Z","links":{"resolver":"https://pith.science/pith/FTNE3NXDVTKU365AQWR2M3BN2Z","bundle":"https://pith.science/pith/FTNE3NXDVTKU365AQWR2M3BN2Z/bundle.json","state":"https://pith.science/pith/FTNE3NXDVTKU365AQWR2M3BN2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTNE3NXDVTKU365AQWR2M3BN2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FTNE3NXDVTKU365AQWR2M3BN2Z","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":"54e76491ea1edbcde382bff8999a29fe12e6b479ceaa383f63322bbe467bd3cd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-10-09T20:39:18Z","title_canon_sha256":"fa385061cfa2e9c18527ef95eb94805d4448cc80465acaae493beb464a700b7c"},"schema_version":"1.0","source":{"id":"2310.06140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.06140","created_at":"2026-07-05T06:59:06Z"},{"alias_kind":"arxiv_version","alias_value":"2310.06140v1","created_at":"2026-07-05T06:59:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.06140","created_at":"2026-07-05T06:59:06Z"},{"alias_kind":"pith_short_12","alias_value":"FTNE3NXDVTKU","created_at":"2026-07-05T06:59:06Z"},{"alias_kind":"pith_short_16","alias_value":"FTNE3NXDVTKU365A","created_at":"2026-07-05T06:59:06Z"},{"alias_kind":"pith_short_8","alias_value":"FTNE3NXD","created_at":"2026-07-05T06:59:06Z"}],"graph_snapshots":[{"event_id":"sha256:63a7237700c9a4824f222789d4bec33eebd25b7c45fd7fbae327f1903ab331fe","target":"graph","created_at":"2026-07-05T06:59:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.06140/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the optimal order (or sequence) of contracting a tensor network with a minimal computational cost. We conclude 2 different versions of this optimal sequence: that minimize the operation number (OMS) and that minimize the time complexity (CMS). Existing results only shows that OMS is NP-hard, but no conclusion on CMS problem. In this work, we firstly reduce CMS to CMS-0, which is a sub-problem of CMS with no free indices. Then we prove that CMS is easier than OMS, both in general and in tree cases. Last but not least, we prove that CMS is still NP-hard. Based on our results, we have bu","authors_text":"Guoqi Li, Hanwen Zhang, Jianyu Xu, Lei Deng, Ling Liang, Yuan Xie","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-10-09T20:39:18Z","title":"NP-Hardness of Tensor Network Contraction Ordering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.06140","kind":"arxiv","version":1},"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:5ee295f851080fb9134f74b4babc3f3749ebeef277ba92c7da1c58f47fdcab24","target":"record","created_at":"2026-07-05T06:59:06Z","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":"54e76491ea1edbcde382bff8999a29fe12e6b479ceaa383f63322bbe467bd3cd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-10-09T20:39:18Z","title_canon_sha256":"fa385061cfa2e9c18527ef95eb94805d4448cc80465acaae493beb464a700b7c"},"schema_version":"1.0","source":{"id":"2310.06140","kind":"arxiv","version":1}},"canonical_sha256":"2cda4db6e3acd54dfba085a3a66c2dd64b33fdaadc8f301667ac39b576049864","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cda4db6e3acd54dfba085a3a66c2dd64b33fdaadc8f301667ac39b576049864","first_computed_at":"2026-07-05T06:59:06.086116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:59:06.086116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uzp7Qv51xOrZFJErWq3AoYw8zBXlKrsSwKijFVpqaj881n3w/DIZ5sS3iPMRL2x1/IJFCYSronwXpPd5Cq1IBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:59:06.086546Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.06140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ee295f851080fb9134f74b4babc3f3749ebeef277ba92c7da1c58f47fdcab24","sha256:63a7237700c9a4824f222789d4bec33eebd25b7c45fd7fbae327f1903ab331fe"],"state_sha256":"c1028021a26615958234206542df48485074d3f17051e3644769984df16cda17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhY9FTD7hh1u9dxOt4G1VKT0z1IM4HBivs89TbY35UJN7hJz31EPIKgs4RCtQaVHpxJzVkXNf02uKZGsQMOxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T14:55:50.218775Z","bundle_sha256":"a70a047bc7a3663e21ceb4f76edc916b2c0ee992197e792c1fc50a431eed637d"}}