{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DEFHIVU5TB2V42QYOTSFLGLK34","short_pith_number":"pith:DEFHIVU5","schema_version":"1.0","canonical_sha256":"190a74569d98755e6a1874e455996adf2d9068a26e37cfeddb36f6f9b9d6b1be","source":{"kind":"arxiv","id":"1908.04381","version":2},"attestation_state":"computed","paper":{"title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.DS","authors_text":"Jeffrey M. Dudek, Leonardo Due\\~nas-Osorio, Moshe Y. Vardi","submitted_at":"2019-08-12T21:01:49Z","abstract_excerpt":"Constrained counting is a fundamental problem in artificial intelligence. A promising new algebraic approach to constrained counting makes use of tensor networks, following a reduction from constrained counting to the problem of tensor-network contraction. Contracting a tensor network efficiently requires determining an efficient order to contract the tensors inside the network, which is itself a difficult problem.\n  In this work, we apply graph decompositions to find contraction orders for tensor networks. We prove that finding an efficient contraction order for a tensor network is equivalent"},"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.04381","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-12T21:01:49Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"bbe612721ca49fbd24d9a27b7d66d1e7679db6929f31209e50f9490d611f5a56","abstract_canon_sha256":"23eeec26e111960a6ed163a95b44c6cf0cced0cf1e00b3b284c841ebd32f39bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:36.582942Z","signature_b64":"uyiGwsVr/83isc079jaPns95EiGZ8GTe1Cw2WX7ygZc9PdVWHFjh800duyfVObryU7HNT9DagYy3gKO1A5KTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"190a74569d98755e6a1874e455996adf2d9068a26e37cfeddb36f6f9b9d6b1be","last_reissued_at":"2026-07-05T00:58:36.582538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:36.582538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.DS","authors_text":"Jeffrey M. Dudek, Leonardo Due\\~nas-Osorio, Moshe Y. Vardi","submitted_at":"2019-08-12T21:01:49Z","abstract_excerpt":"Constrained counting is a fundamental problem in artificial intelligence. A promising new algebraic approach to constrained counting makes use of tensor networks, following a reduction from constrained counting to the problem of tensor-network contraction. Contracting a tensor network efficiently requires determining an efficient order to contract the tensors inside the network, which is itself a difficult problem.\n  In this work, we apply graph decompositions to find contraction orders for tensor networks. We prove that finding an efficient contraction order for a tensor network is equivalent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04381","kind":"arxiv","version":2},"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.04381/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.04381","created_at":"2026-07-05T00:58:36.582607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04381v2","created_at":"2026-07-05T00:58:36.582607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04381","created_at":"2026-07-05T00:58:36.582607+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEFHIVU5TB2V","created_at":"2026-07-05T00:58:36.582607+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEFHIVU5TB2V42QY","created_at":"2026-07-05T00:58:36.582607+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEFHIVU5","created_at":"2026-07-05T00:58:36.582607+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.07720","citing_title":"Counting with the quantum alternating operator ansatz","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00106","citing_title":"From Tensor Networks to Tractable Circuits, and back","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34","json":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34.json","graph_json":"https://pith.science/api/pith-number/DEFHIVU5TB2V42QYOTSFLGLK34/graph.json","events_json":"https://pith.science/api/pith-number/DEFHIVU5TB2V42QYOTSFLGLK34/events.json","paper":"https://pith.science/paper/DEFHIVU5"},"agent_actions":{"view_html":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34","download_json":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34.json","view_paper":"https://pith.science/paper/DEFHIVU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04381&json=true","fetch_graph":"https://pith.science/api/pith-number/DEFHIVU5TB2V42QYOTSFLGLK34/graph.json","fetch_events":"https://pith.science/api/pith-number/DEFHIVU5TB2V42QYOTSFLGLK34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34/action/storage_attestation","attest_author":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34/action/author_attestation","sign_citation":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34/action/citation_signature","submit_replication":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34/action/replication_record"}},"created_at":"2026-07-05T00:58:36.582607+00:00","updated_at":"2026-07-05T00:58:36.582607+00:00"}