{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SKC2KSXCLHEYAR7ZQDLZ3BYMVV","short_pith_number":"pith:SKC2KSXC","schema_version":"1.0","canonical_sha256":"9285a54ae259c98047f980d79d870cad5ec375f4a79a3e08ff1db2a02f5916fd","source":{"kind":"arxiv","id":"1906.00311","version":2},"attestation_state":"computed","paper":{"title":"Smoothing Structured Decomposable Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Andy Shih, Antoine Amarilli, Guy Van den Broeck, Paul Beame","submitted_at":"2019-06-01T23:25:38Z","abstract_excerpt":"We study the task of smoothing a circuit, i.e., ensuring that all children of a plus-gate mention the same variables. Circuits serve as the building blocks of state-of-the-art inference algorithms on discrete probabilistic graphical models and probabilistic programs. They are also important for discrete density estimation algorithms. Many of these tasks require the input circuit to be smooth. However, smoothing has not been studied in its own right yet, and only a trivial quadratic algorithm is known. This paper studies efficient smoothing for structured decomposable circuits. We propose a nea"},"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":"1906.00311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-01T23:25:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f8a6f98cd6db12c03f38f7b2aca68b3ba45d5dadd352bc49086adbad4a9443a8","abstract_canon_sha256":"c2ebc8d6e604d6a4a51b07c6867062362b054576c9ef59a71d80a147ddd5fd48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:05.924907Z","signature_b64":"gEIWmMOnoIRKR0Li6iJQ9/6CN+SpA3/TzUct41RSPulU7SVFByhhTQTeB1IfMZkTFOQFRs5i+b55JxbsIh8rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9285a54ae259c98047f980d79d870cad5ec375f4a79a3e08ff1db2a02f5916fd","last_reissued_at":"2026-07-05T00:15:05.924364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:05.924364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smoothing Structured Decomposable Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Andy Shih, Antoine Amarilli, Guy Van den Broeck, Paul Beame","submitted_at":"2019-06-01T23:25:38Z","abstract_excerpt":"We study the task of smoothing a circuit, i.e., ensuring that all children of a plus-gate mention the same variables. Circuits serve as the building blocks of state-of-the-art inference algorithms on discrete probabilistic graphical models and probabilistic programs. They are also important for discrete density estimation algorithms. Many of these tasks require the input circuit to be smooth. However, smoothing has not been studied in its own right yet, and only a trivial quadratic algorithm is known. This paper studies efficient smoothing for structured decomposable circuits. We propose a nea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00311","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/1906.00311/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":"1906.00311","created_at":"2026-07-05T00:15:05.924428+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00311v2","created_at":"2026-07-05T00:15:05.924428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00311","created_at":"2026-07-05T00:15:05.924428+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKC2KSXCLHEY","created_at":"2026-07-05T00:15:05.924428+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKC2KSXCLHEYAR7Z","created_at":"2026-07-05T00:15:05.924428+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKC2KSXC","created_at":"2026-07-05T00:15:05.924428+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/SKC2KSXCLHEYAR7ZQDLZ3BYMVV","json":"https://pith.science/pith/SKC2KSXCLHEYAR7ZQDLZ3BYMVV.json","graph_json":"https://pith.science/api/pith-number/SKC2KSXCLHEYAR7ZQDLZ3BYMVV/graph.json","events_json":"https://pith.science/api/pith-number/SKC2KSXCLHEYAR7ZQDLZ3BYMVV/events.json","paper":"https://pith.science/paper/SKC2KSXC"},"agent_actions":{"view_html":"https://pith.science/pith/SKC2KSXCLHEYAR7ZQDLZ3BYMVV","download_json":"https://pith.science/pith/SKC2KSXCLHEYAR7ZQDLZ3BYMVV.json","view_paper":"https://pith.science/paper/SKC2KSXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00311&json=true","fetch_graph":"https://pith.science/api/pith-number/SKC2KSXCLHEYAR7ZQDLZ3BYMVV/graph.json","fetch_events":"https://pith.science/api/pith-number/SKC2KSXCLHEYAR7ZQDLZ3BYMVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKC2KSXCLHEYAR7ZQDLZ3BYMVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKC2KSXCLHEYAR7ZQDLZ3BYMVV/action/storage_attestation","attest_author":"https://pith.science/pith/SKC2KSXCLHEYAR7ZQDLZ3BYMVV/action/author_attestation","sign_citation":"https://pith.science/pith/SKC2KSXCLHEYAR7ZQDLZ3BYMVV/action/citation_signature","submit_replication":"https://pith.science/pith/SKC2KSXCLHEYAR7ZQDLZ3BYMVV/action/replication_record"}},"created_at":"2026-07-05T00:15:05.924428+00:00","updated_at":"2026-07-05T00:15:05.924428+00:00"}