{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KCP2MIIH4CLODOR4W6CCD2HACP","short_pith_number":"pith:KCP2MIIH","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"},"canonical_sha256":"509fa62107e096e1ba3cb78421e8e013c2654a65665243ac24081502c8d32fb7","source":{"kind":"arxiv","id":"1812.11948","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11948","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11948v1","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11948","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"pith_short_12","alias_value":"KCP2MIIH4CLO","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KCP2MIIH4CLODOR4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KCP2MIIH","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KCP2MIIH4CLODOR4W6CCD2HACP","target":"record","payload":{"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"},"canonical_sha256":"509fa62107e096e1ba3cb78421e8e013c2654a65665243ac24081502c8d32fb7","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"},"source_kind":"arxiv","source_id":"1812.11948","source_version":1,"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-05-17T23:57:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61pgWqH8WBvSXyxQG8Hd5hX1yUL0R4m5lKixWb+C1mF8sdsU8YE1HtUJKEjrK/wNAYAF/iUbOjubejyULjBOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:45:30.475745Z"},"content_sha256":"99789549d98559aeca8532162df9c62b8659c0067f1ee80b792d31e0aee05d32","schema_version":"1.0","event_id":"sha256:99789549d98559aeca8532162df9c62b8659c0067f1ee80b792d31e0aee05d32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KCP2MIIH4CLODOR4W6CCD2HACP","target":"graph","payload":{"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"},"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-05-17T23:57:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XClE890jHcp8uG57Dv4amDcH0HY4O6HiYsocMeyFTarai5wQD1bkec3XmoSE1IDiszz2xmRlOHxIRN+f1uCEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:45:30.476097Z"},"content_sha256":"215e8b7f859d08b7a67173cb73def823ee5a15986f501a8d9862dcc6b4030716","schema_version":"1.0","event_id":"sha256:215e8b7f859d08b7a67173cb73def823ee5a15986f501a8d9862dcc6b4030716"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP/bundle.json","state_url":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCP2MIIH4CLODOR4W6CCD2HACP/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-06-20T04:45:30Z","links":{"resolver":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP","bundle":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP/bundle.json","state":"https://pith.science/pith/KCP2MIIH4CLODOR4W6CCD2HACP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCP2MIIH4CLODOR4W6CCD2HACP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KCP2MIIH4CLODOR4W6CCD2HACP","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":"8f991c801f8b51bf334cddf4c5c1c549c59c55327baf5474b6a198e8ab3caf7d","cross_cats_sorted":["cs.LG","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-31T18:39:58Z","title_canon_sha256":"81aa06337199afc6d722bf536d2f6d0af629313216aca6fb7e6d9817d43e5b8f"},"schema_version":"1.0","source":{"id":"1812.11948","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11948","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11948v1","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11948","created_at":"2026-05-17T23:57:10Z"},{"alias_kind":"pith_short_12","alias_value":"KCP2MIIH4CLO","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KCP2MIIH4CLODOR4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KCP2MIIH","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:215e8b7f859d08b7a67173cb73def823ee5a15986f501a8d9862dcc6b4030716","target":"graph","created_at":"2026-05-17T23:57:10Z","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"},"paper":{"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","authors_text":"Matthias Nickles","cross_cats":["cs.LG","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-31T18:39:58Z","title":"Differentiable Satisfiability and Differentiable Answer Set Programming for Sampling-Based Multi-Model Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11948","kind":"arxiv","version":1},"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:99789549d98559aeca8532162df9c62b8659c0067f1ee80b792d31e0aee05d32","target":"record","created_at":"2026-05-17T23:57:10Z","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":"8f991c801f8b51bf334cddf4c5c1c549c59c55327baf5474b6a198e8ab3caf7d","cross_cats_sorted":["cs.LG","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-31T18:39:58Z","title_canon_sha256":"81aa06337199afc6d722bf536d2f6d0af629313216aca6fb7e6d9817d43e5b8f"},"schema_version":"1.0","source":{"id":"1812.11948","kind":"arxiv","version":1}},"canonical_sha256":"509fa62107e096e1ba3cb78421e8e013c2654a65665243ac24081502c8d32fb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"509fa62107e096e1ba3cb78421e8e013c2654a65665243ac24081502c8d32fb7","first_computed_at":"2026-05-17T23:57:10.728966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:10.728966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xO7inZj5TGZoBZyCQVn1kpaN287XdI8lxz4cEipLzE14qpnLIu4seyR4ajIrcF8eCXq501J6YxJzSKKo6XK6DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:10.729884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.11948","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99789549d98559aeca8532162df9c62b8659c0067f1ee80b792d31e0aee05d32","sha256:215e8b7f859d08b7a67173cb73def823ee5a15986f501a8d9862dcc6b4030716"],"state_sha256":"dd71c68d0d6057c7b02ab4b9825ad2e6007b73b7895018b1169380174f863acb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQfRP8MJt3rzb/TEtKk+/676RnCrHnm6D2wRcVAL+qGsHMPAFl38ZL3hTUSI37FoUTL9JiUjTWTP6q+SLvlcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:45:30.477962Z","bundle_sha256":"8a25b8a609325f7a70c3a0d1628ec56ceefe86660904d37c85a168af9c7aebcb"}}