{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZFMWR4NJG4HC6OSFG3F7AO7VTJ","short_pith_number":"pith:ZFMWR4NJ","schema_version":"1.0","canonical_sha256":"c95968f1a9370e2f3a4536cbf03bf59a57a1551cd4b3ebce71e39e26119996b5","source":{"kind":"arxiv","id":"2507.20667","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Tensor Network Partitioning using Simulated Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christian B. Mendl, Manuel Geiger, Qunsheng Huang","submitted_at":"2025-07-28T09:43:01Z","abstract_excerpt":"Tensor networks have proven to be a valuable tool, for instance, in the classical simulation of (strongly correlated) quantum systems. As the size of the systems increases, contracting larger tensor networks becomes computationally demanding. In this work, we study distributed memory architectures intended for high-performance computing implementations to solve this task. Efficiently distributing the contraction task across multiple nodes is critical, as both computational and memory costs are highly sensitive to the chosen partitioning strategy. While prior work has employed general-purpose h"},"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":"2507.20667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-28T09:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"bea167630310c0e38348eb139cbddb93aea6000d249004d7efd583c933fa109e","abstract_canon_sha256":"4e173516c2fc9640367e3098f03b5f19239d8269dedafc7ffab7d533128a8f10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:23.792168Z","signature_b64":"+JvST/lFq3HfbQxAyAsLYgrS+x/IRIlcDp+HN/EYg4MjL3wqT9sHhTmpqIF81Dlzcsdx/JG0NB9KmKXqS/4nCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c95968f1a9370e2f3a4536cbf03bf59a57a1551cd4b3ebce71e39e26119996b5","last_reissued_at":"2026-07-05T11:44:23.791774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:23.791774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Tensor Network Partitioning using Simulated Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christian B. Mendl, Manuel Geiger, Qunsheng Huang","submitted_at":"2025-07-28T09:43:01Z","abstract_excerpt":"Tensor networks have proven to be a valuable tool, for instance, in the classical simulation of (strongly correlated) quantum systems. As the size of the systems increases, contracting larger tensor networks becomes computationally demanding. In this work, we study distributed memory architectures intended for high-performance computing implementations to solve this task. Efficiently distributing the contraction task across multiple nodes is critical, as both computational and memory costs are highly sensitive to the chosen partitioning strategy. While prior work has employed general-purpose h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20667","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/2507.20667/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":"2507.20667","created_at":"2026-07-05T11:44:23.791829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.20667v1","created_at":"2026-07-05T11:44:23.791829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20667","created_at":"2026-07-05T11:44:23.791829+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFMWR4NJG4HC","created_at":"2026-07-05T11:44:23.791829+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFMWR4NJG4HC6OSF","created_at":"2026-07-05T11:44:23.791829+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFMWR4NJ","created_at":"2026-07-05T11:44:23.791829+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/ZFMWR4NJG4HC6OSFG3F7AO7VTJ","json":"https://pith.science/pith/ZFMWR4NJG4HC6OSFG3F7AO7VTJ.json","graph_json":"https://pith.science/api/pith-number/ZFMWR4NJG4HC6OSFG3F7AO7VTJ/graph.json","events_json":"https://pith.science/api/pith-number/ZFMWR4NJG4HC6OSFG3F7AO7VTJ/events.json","paper":"https://pith.science/paper/ZFMWR4NJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZFMWR4NJG4HC6OSFG3F7AO7VTJ","download_json":"https://pith.science/pith/ZFMWR4NJG4HC6OSFG3F7AO7VTJ.json","view_paper":"https://pith.science/paper/ZFMWR4NJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.20667&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFMWR4NJG4HC6OSFG3F7AO7VTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFMWR4NJG4HC6OSFG3F7AO7VTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFMWR4NJG4HC6OSFG3F7AO7VTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFMWR4NJG4HC6OSFG3F7AO7VTJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZFMWR4NJG4HC6OSFG3F7AO7VTJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZFMWR4NJG4HC6OSFG3F7AO7VTJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZFMWR4NJG4HC6OSFG3F7AO7VTJ/action/replication_record"}},"created_at":"2026-07-05T11:44:23.791829+00:00","updated_at":"2026-07-05T11:44:23.791829+00:00"}