{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5BMACC7FRTVMGPWEKGYXMHDM62","short_pith_number":"pith:5BMACC7F","canonical_record":{"source":{"id":"1807.04599","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T13:32:55Z","cross_cats_sorted":["physics.comp-ph","quant-ph"],"title_canon_sha256":"8ba96043f43178a737dc4031c870788a6c62305428728e978775fcc254b114c9","abstract_canon_sha256":"ac147ec3d633221aa696e084b288e7f5e1fd62843ce09b27447d805f7ec4f4cc"},"schema_version":"1.0"},"canonical_sha256":"e858010be58ceac33ec451b1761c6cf69d807a7348f26ffd261faa7273a99646","source":{"kind":"arxiv","id":"1807.04599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04599","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04599v1","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04599","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"5BMACC7FRTVM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5BMACC7FRTVMGPWE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5BMACC7F","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5BMACC7FRTVMGPWEKGYXMHDM62","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04599","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T13:32:55Z","cross_cats_sorted":["physics.comp-ph","quant-ph"],"title_canon_sha256":"8ba96043f43178a737dc4031c870788a6c62305428728e978775fcc254b114c9","abstract_canon_sha256":"ac147ec3d633221aa696e084b288e7f5e1fd62843ce09b27447d805f7ec4f4cc"},"schema_version":"1.0"},"canonical_sha256":"e858010be58ceac33ec451b1761c6cf69d807a7348f26ffd261faa7273a99646","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:07.319028Z","signature_b64":"GskuikqUJv7Wpo9Luxs4SIQCyDl6ffduboebIIHq3nBYl8I2uB9Zt7ejP4J0GZVksBjI6+OWczbyX6uDFIKhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e858010be58ceac33ec451b1761c6cf69d807a7348f26ffd261faa7273a99646","last_reissued_at":"2026-05-17T23:52:07.318543Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:07.318543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04599","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-05-17T23:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3bHdi82nLWl3q0wj/dEqTO7Du+UuNOP6HN9OM+Ps0dVI6HEqJfuRIaWnzEo8wg+/9LO86O4DUlXUEB1dTNwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:49:50.028395Z"},"content_sha256":"03e09b45996a7a3c07f3942b81186ab9e3ca4896d420f112a13f892271659b6e","schema_version":"1.0","event_id":"sha256:03e09b45996a7a3c07f3942b81186ab9e3ca4896d420f112a13f892271659b6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5BMACC7FRTVMGPWEKGYXMHDM62","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Benchmarking treewidth as a practical component of tensor-network--based quantum simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["physics.comp-ph","quant-ph"],"primary_cat":"cs.DS","authors_text":"Allison L. Fisher, Andrew L. Wright, Blair D. Sullivan, Eugene F. Dumitrescu, Timothy D. Goodrich, Travis S. Humble","submitted_at":"2018-07-12T13:32:55Z","abstract_excerpt":"Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network's line graph, r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04599","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":""},"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-05-17T23:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rxNKsv9LGJ9Zcyr/YtXgMb106ax5Bu1D/jRDv2qbwcjOOP78e0nkJNtNytd6+6jSqf/3dEuo7vV7HGMhFPtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:49:50.028840Z"},"content_sha256":"6ed48a5005b7556125d2dd11131c8ce62374c3bddd267e34a22f8b94e26e97b2","schema_version":"1.0","event_id":"sha256:6ed48a5005b7556125d2dd11131c8ce62374c3bddd267e34a22f8b94e26e97b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BMACC7FRTVMGPWEKGYXMHDM62/bundle.json","state_url":"https://pith.science/pith/5BMACC7FRTVMGPWEKGYXMHDM62/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BMACC7FRTVMGPWEKGYXMHDM62/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-05-27T15:49:50Z","links":{"resolver":"https://pith.science/pith/5BMACC7FRTVMGPWEKGYXMHDM62","bundle":"https://pith.science/pith/5BMACC7FRTVMGPWEKGYXMHDM62/bundle.json","state":"https://pith.science/pith/5BMACC7FRTVMGPWEKGYXMHDM62/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BMACC7FRTVMGPWEKGYXMHDM62/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5BMACC7FRTVMGPWEKGYXMHDM62","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":"ac147ec3d633221aa696e084b288e7f5e1fd62843ce09b27447d805f7ec4f4cc","cross_cats_sorted":["physics.comp-ph","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T13:32:55Z","title_canon_sha256":"8ba96043f43178a737dc4031c870788a6c62305428728e978775fcc254b114c9"},"schema_version":"1.0","source":{"id":"1807.04599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04599","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04599v1","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04599","created_at":"2026-05-17T23:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"5BMACC7FRTVM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5BMACC7FRTVMGPWE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5BMACC7F","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:6ed48a5005b7556125d2dd11131c8ce62374c3bddd267e34a22f8b94e26e97b2","target":"graph","created_at":"2026-05-17T23:52:07Z","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"},"paper":{"abstract_excerpt":"Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network's line graph, r","authors_text":"Allison L. Fisher, Andrew L. Wright, Blair D. Sullivan, Eugene F. Dumitrescu, Timothy D. Goodrich, Travis S. Humble","cross_cats":["physics.comp-ph","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T13:32:55Z","title":"Benchmarking treewidth as a practical component of tensor-network--based quantum simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04599","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:03e09b45996a7a3c07f3942b81186ab9e3ca4896d420f112a13f892271659b6e","target":"record","created_at":"2026-05-17T23:52:07Z","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":"ac147ec3d633221aa696e084b288e7f5e1fd62843ce09b27447d805f7ec4f4cc","cross_cats_sorted":["physics.comp-ph","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T13:32:55Z","title_canon_sha256":"8ba96043f43178a737dc4031c870788a6c62305428728e978775fcc254b114c9"},"schema_version":"1.0","source":{"id":"1807.04599","kind":"arxiv","version":1}},"canonical_sha256":"e858010be58ceac33ec451b1761c6cf69d807a7348f26ffd261faa7273a99646","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e858010be58ceac33ec451b1761c6cf69d807a7348f26ffd261faa7273a99646","first_computed_at":"2026-05-17T23:52:07.318543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:07.318543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GskuikqUJv7Wpo9Luxs4SIQCyDl6ffduboebIIHq3nBYl8I2uB9Zt7ejP4J0GZVksBjI6+OWczbyX6uDFIKhDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:07.319028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03e09b45996a7a3c07f3942b81186ab9e3ca4896d420f112a13f892271659b6e","sha256:6ed48a5005b7556125d2dd11131c8ce62374c3bddd267e34a22f8b94e26e97b2"],"state_sha256":"fe1e68ed21007a376064f924025bbd03c01425ed5fc81bc496e0932f67a371bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPrOQwj4mosTcRWFxmMlAeh+aalB2ErmC4fsV3anTyk6+82TJErZx9bSz+Oi9hY2TPLEFiDk7PFiVk5xIDUxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:49:50.031722Z","bundle_sha256":"80036b2f21dafd75892a0f2b4fde1cb157851e08eaa7a92ea44aa190164d0e70"}}