{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KCP2MIIH4CLODOR4W6CCD2HACP","short_pith_number":"pith:KCP2MIIH","schema_version":"1.0","canonical_sha256":"509fa62107e096e1ba3cb78421e8e013c2654a65665243ac24081502c8d32fb7","source":{"kind":"arxiv","id":"1812.11948","version":1},"attestation_state":"computed","paper":{"title":"Differentiable Satisfiability and Differentiable Answer Set Programming for Sampling-Based Multi-Model Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Matthias Nickles","submitted_at":"2018-12-31T18:39:58Z","abstract_excerpt":"We propose Differentiable Satisfiability and Differentiable Answer Set Programming (Differentiable SAT/ASP) for multi-model optimization. Models (answer sets or satisfying truth assignments) are sampled using a novel SAT/ASP solving approach which uses a gradient descent-based branching mechanism. Sampling proceeds until the value of a user-defined multi-model cost function reaches a given threshold. As major use cases for our approach we propose distribution-aware model sampling and expressive yet scalable probabilistic logic programming. As our main algorithmic approach to Differentiable SAT"},"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":"1812.11948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-31T18:39:58Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"81aa06337199afc6d722bf536d2f6d0af629313216aca6fb7e6d9817d43e5b8f","abstract_canon_sha256":"8f991c801f8b51bf334cddf4c5c1c549c59c55327baf5474b6a198e8ab3caf7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:10.729884Z","signature_b64":"xO7inZj5TGZoBZyCQVn1kpaN287XdI8lxz4cEipLzE14qpnLIu4seyR4ajIrcF8eCXq501J6YxJzSKKo6XK6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"509fa62107e096e1ba3cb78421e8e013c2654a65665243ac24081502c8d32fb7","last_reissued_at":"2026-05-17T23:57:10.728966Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:10.728966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentiable Satisfiability and Differentiable Answer Set Programming for Sampling-Based Multi-Model Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Matthias Nickles","submitted_at":"2018-12-31T18:39:58Z","abstract_excerpt":"We propose Differentiable Satisfiability and Differentiable Answer Set Programming (Differentiable SAT/ASP) for multi-model optimization. Models (answer sets or satisfying truth assignments) are sampled using a novel SAT/ASP solving approach which uses a gradient descent-based branching mechanism. Sampling proceeds until the value of a user-defined multi-model cost function reaches a given threshold. As major use cases for our approach we propose distribution-aware model sampling and expressive yet scalable probabilistic logic programming. As our main algorithmic approach to Differentiable SAT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11948","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.11948","created_at":"2026-05-17T23:57:10.729106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.11948v1","created_at":"2026-05-17T23:57:10.729106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11948","created_at":"2026-05-17T23:57:10.729106+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCP2MIIH4CLO","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCP2MIIH4CLODOR4","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCP2MIIH","created_at":"2026-05-18T12:32:33.847187+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/KCP2MIIH4CLODOR4W6CCD2HACP","json":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP.json","graph_json":"https://pith.science/api/pith-number/KCP2MIIH4CLODOR4W6CCD2HACP/graph.json","events_json":"https://pith.science/api/pith-number/KCP2MIIH4CLODOR4W6CCD2HACP/events.json","paper":"https://pith.science/paper/KCP2MIIH"},"agent_actions":{"view_html":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP","download_json":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP.json","view_paper":"https://pith.science/paper/KCP2MIIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.11948&json=true","fetch_graph":"https://pith.science/api/pith-number/KCP2MIIH4CLODOR4W6CCD2HACP/graph.json","fetch_events":"https://pith.science/api/pith-number/KCP2MIIH4CLODOR4W6CCD2HACP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP/action/storage_attestation","attest_author":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP/action/author_attestation","sign_citation":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP/action/citation_signature","submit_replication":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP/action/replication_record"}},"created_at":"2026-05-17T23:57:10.729106+00:00","updated_at":"2026-05-17T23:57:10.729106+00:00"}