{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LMYJ236PMO7MK422KP75TYBNGK","short_pith_number":"pith:LMYJ236P","schema_version":"1.0","canonical_sha256":"5b309d6fcf63bec5735a53ffd9e02d32bccf64e8fd33bb2c45df2dc9c0a6d543","source":{"kind":"arxiv","id":"2412.14814","version":1},"attestation_state":"computed","paper":{"title":"Answer Set Networks: Casting Answer Set Programming into Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SC"],"primary_cat":"cs.AI","authors_text":"Arseny Skryagin, Daniel Ochs, Devendra Singh Dhami, Kristian Kersting, Phillip Deibert, Simon Kohaut","submitted_at":"2024-12-19T13:09:06Z","abstract_excerpt":"Although Answer Set Programming (ASP) allows constraining neural-symbolic (NeSy) systems, its employment is hindered by the prohibitive costs of computing stable models and the CPU-bound nature of state-of-the-art solvers. To this end, we propose Answer Set Networks (ASN), a NeSy solver. Based on Graph Neural Networks (GNN), ASNs are a scalable approach to ASP-based Deep Probabilistic Logic Programming (DPPL). Specifically, we show how to translate ASPs into ASNs and demonstrate how ASNs can efficiently solve the encoded problem by leveraging GPU's batching and parallelization capabilities. Ou"},"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":"2412.14814","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-12-19T13:09:06Z","cross_cats_sorted":["cs.LG","cs.SC"],"title_canon_sha256":"6a5e927becfe602cb963644d80c33100e9e26da77e125029f7751db2d72304d2","abstract_canon_sha256":"9f952738dc38f49bfd5a46f23a07d617476dea2c39da3ddbd37387c4f181cead"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:53.200462Z","signature_b64":"cgb+ZHNUbGozT9//iRYMX9pfyTO6xQQuQAj4FN/ttlhA67eG2P8x2pk0sIEpLIKD1oQuwahVG/IU84NnrJElAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b309d6fcf63bec5735a53ffd9e02d32bccf64e8fd33bb2c45df2dc9c0a6d543","last_reissued_at":"2026-07-05T09:51:53.200015Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:53.200015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Answer Set Networks: Casting Answer Set Programming into Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SC"],"primary_cat":"cs.AI","authors_text":"Arseny Skryagin, Daniel Ochs, Devendra Singh Dhami, Kristian Kersting, Phillip Deibert, Simon Kohaut","submitted_at":"2024-12-19T13:09:06Z","abstract_excerpt":"Although Answer Set Programming (ASP) allows constraining neural-symbolic (NeSy) systems, its employment is hindered by the prohibitive costs of computing stable models and the CPU-bound nature of state-of-the-art solvers. To this end, we propose Answer Set Networks (ASN), a NeSy solver. Based on Graph Neural Networks (GNN), ASNs are a scalable approach to ASP-based Deep Probabilistic Logic Programming (DPPL). Specifically, we show how to translate ASPs into ASNs and demonstrate how ASNs can efficiently solve the encoded problem by leveraging GPU's batching and parallelization capabilities. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14814","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.14814/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":"2412.14814","created_at":"2026-07-05T09:51:53.200073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.14814v1","created_at":"2026-07-05T09:51:53.200073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14814","created_at":"2026-07-05T09:51:53.200073+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMYJ236PMO7M","created_at":"2026-07-05T09:51:53.200073+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMYJ236PMO7MK422","created_at":"2026-07-05T09:51:53.200073+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMYJ236P","created_at":"2026-07-05T09:51:53.200073+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19251","citing_title":"Streamliners for Answer Set Programming","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LMYJ236PMO7MK422KP75TYBNGK","json":"https://pith.science/pith/LMYJ236PMO7MK422KP75TYBNGK.json","graph_json":"https://pith.science/api/pith-number/LMYJ236PMO7MK422KP75TYBNGK/graph.json","events_json":"https://pith.science/api/pith-number/LMYJ236PMO7MK422KP75TYBNGK/events.json","paper":"https://pith.science/paper/LMYJ236P"},"agent_actions":{"view_html":"https://pith.science/pith/LMYJ236PMO7MK422KP75TYBNGK","download_json":"https://pith.science/pith/LMYJ236PMO7MK422KP75TYBNGK.json","view_paper":"https://pith.science/paper/LMYJ236P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.14814&json=true","fetch_graph":"https://pith.science/api/pith-number/LMYJ236PMO7MK422KP75TYBNGK/graph.json","fetch_events":"https://pith.science/api/pith-number/LMYJ236PMO7MK422KP75TYBNGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMYJ236PMO7MK422KP75TYBNGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMYJ236PMO7MK422KP75TYBNGK/action/storage_attestation","attest_author":"https://pith.science/pith/LMYJ236PMO7MK422KP75TYBNGK/action/author_attestation","sign_citation":"https://pith.science/pith/LMYJ236PMO7MK422KP75TYBNGK/action/citation_signature","submit_replication":"https://pith.science/pith/LMYJ236PMO7MK422KP75TYBNGK/action/replication_record"}},"created_at":"2026-07-05T09:51:53.200073+00:00","updated_at":"2026-07-05T09:51:53.200073+00:00"}