{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DEFHIVU5TB2V42QYOTSFLGLK34","short_pith_number":"pith:DEFHIVU5","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"},"canonical_sha256":"190a74569d98755e6a1874e455996adf2d9068a26e37cfeddb36f6f9b9d6b1be","source":{"kind":"arxiv","id":"1908.04381","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04381","created_at":"2026-07-05T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04381v2","created_at":"2026-07-05T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04381","created_at":"2026-07-05T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"DEFHIVU5TB2V","created_at":"2026-07-05T00:58:36Z"},{"alias_kind":"pith_short_16","alias_value":"DEFHIVU5TB2V42QY","created_at":"2026-07-05T00:58:36Z"},{"alias_kind":"pith_short_8","alias_value":"DEFHIVU5","created_at":"2026-07-05T00:58:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DEFHIVU5TB2V42QYOTSFLGLK34","target":"record","payload":{"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"},"canonical_sha256":"190a74569d98755e6a1874e455996adf2d9068a26e37cfeddb36f6f9b9d6b1be","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"},"source_kind":"arxiv","source_id":"1908.04381","source_version":2,"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-05T00:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X10JuYi82ahJTlxeEMLAsQWiSC8JxN8/KRyoxH2CLIJLcLtnqR0y1FBYJPLF52zoZmmbXQRC+jdOCKu4pzJWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T04:47:29.802574Z"},"content_sha256":"25a20dc1e2114e8ffe909d77f2107714706a9c8e4f1d187e3baafcc5ecb7e3d2","schema_version":"1.0","event_id":"sha256:25a20dc1e2114e8ffe909d77f2107714706a9c8e4f1d187e3baafcc5ecb7e3d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DEFHIVU5TB2V42QYOTSFLGLK34","target":"graph","payload":{"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"},"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-05T00:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyNnKxJmyeT2ELo605j99OYsGNAx9rKiMxqMC9iTB+PmCQYzXdjzoiKLO5QDi0mow0U9kjrBero8cGuLxnyhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T04:47:29.803104Z"},"content_sha256":"101f7f88197bb6f705a23b6bbe96d98310b9df6f585b9959ffb440f48d09c485","schema_version":"1.0","event_id":"sha256:101f7f88197bb6f705a23b6bbe96d98310b9df6f585b9959ffb440f48d09c485"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34/bundle.json","state_url":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEFHIVU5TB2V42QYOTSFLGLK34/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-15T04:47:29Z","links":{"resolver":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34","bundle":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34/bundle.json","state":"https://pith.science/pith/DEFHIVU5TB2V42QYOTSFLGLK34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEFHIVU5TB2V42QYOTSFLGLK34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DEFHIVU5TB2V42QYOTSFLGLK34","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":"23eeec26e111960a6ed163a95b44c6cf0cced0cf1e00b3b284c841ebd32f39bb","cross_cats_sorted":["cs.AI","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-12T21:01:49Z","title_canon_sha256":"bbe612721ca49fbd24d9a27b7d66d1e7679db6929f31209e50f9490d611f5a56"},"schema_version":"1.0","source":{"id":"1908.04381","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04381","created_at":"2026-07-05T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04381v2","created_at":"2026-07-05T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04381","created_at":"2026-07-05T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"DEFHIVU5TB2V","created_at":"2026-07-05T00:58:36Z"},{"alias_kind":"pith_short_16","alias_value":"DEFHIVU5TB2V42QY","created_at":"2026-07-05T00:58:36Z"},{"alias_kind":"pith_short_8","alias_value":"DEFHIVU5","created_at":"2026-07-05T00:58:36Z"}],"graph_snapshots":[{"event_id":"sha256:101f7f88197bb6f705a23b6bbe96d98310b9df6f585b9959ffb440f48d09c485","target":"graph","created_at":"2026-07-05T00:58:36Z","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/1908.04381/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jeffrey M. Dudek, Leonardo Due\\~nas-Osorio, Moshe Y. Vardi","cross_cats":["cs.AI","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-12T21:01:49Z","title":"Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04381","kind":"arxiv","version":2},"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:25a20dc1e2114e8ffe909d77f2107714706a9c8e4f1d187e3baafcc5ecb7e3d2","target":"record","created_at":"2026-07-05T00:58:36Z","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":"23eeec26e111960a6ed163a95b44c6cf0cced0cf1e00b3b284c841ebd32f39bb","cross_cats_sorted":["cs.AI","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-12T21:01:49Z","title_canon_sha256":"bbe612721ca49fbd24d9a27b7d66d1e7679db6929f31209e50f9490d611f5a56"},"schema_version":"1.0","source":{"id":"1908.04381","kind":"arxiv","version":2}},"canonical_sha256":"190a74569d98755e6a1874e455996adf2d9068a26e37cfeddb36f6f9b9d6b1be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"190a74569d98755e6a1874e455996adf2d9068a26e37cfeddb36f6f9b9d6b1be","first_computed_at":"2026-07-05T00:58:36.582538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:58:36.582538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uyiGwsVr/83isc079jaPns95EiGZ8GTe1Cw2WX7ygZc9PdVWHFjh800duyfVObryU7HNT9DagYy3gKO1A5KTBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:58:36.582942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04381","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25a20dc1e2114e8ffe909d77f2107714706a9c8e4f1d187e3baafcc5ecb7e3d2","sha256:101f7f88197bb6f705a23b6bbe96d98310b9df6f585b9959ffb440f48d09c485"],"state_sha256":"f3fbdbd77d77ccd0cab31bfd3ee79cd798b2935ceaaed1c484f4f17fff1f6931"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwYvv5YfAUJ5PQi8zJORoKp0cn0JAZ4+CeegoqPxmcGnbgQ/9IGlInee8SaknUA4Kzo91Bfr2gG9RR0tOuygCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T04:47:29.808987Z","bundle_sha256":"63030e0d682bee744d0b9788582788d95dabbd475a4fcec0f41fedc555de1ca0"}}