{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BYYGO5OPIE3ZZBJDE36TP6DONZ","short_pith_number":"pith:BYYGO5OP","schema_version":"1.0","canonical_sha256":"0e306775cf41379c852326fd37f86e6e7f66665f3464d0ee96faf9f07cd26f5e","source":{"kind":"arxiv","id":"2407.09015","version":1},"attestation_state":"computed","paper":{"title":"Static Analysis of Logic Programs via Boolean Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Belaid Benhamou, Van-Giang Trinh","submitted_at":"2024-07-12T06:07:05Z","abstract_excerpt":"Answer Set Programming (ASP) is a declarative problem solving paradigm that can be used to encode a combinatorial problem as a logic program whose stable models correspond to the solutions of the considered problem. ASP has been widely applied to various domains in AI and beyond. The question \"What can be said about stable models of a logic program from its static information?\" has been investigated and proved useful in many circumstances. In this work, we dive into this direction more deeply by making the connection between a logic program and a Boolean network, which is a prominent modeling "},"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":"2407.09015","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-07-12T06:07:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5a7b56f32b5385fdac2f7c828a573347065b8d635c52b61758438169332ee6d8","abstract_canon_sha256":"b444f663d7cfc676505da458a86f46de11e234104f8d11bb57b74ee2d26f76ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:13.232857Z","signature_b64":"B+7VloDzQ/kJyeA0dnKBlAZ+GlEM5gxiHLaC2+lMGzBYF8hXcMwODjTZ19RX4xTJoKMVeSzT4737A+zqsG17Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e306775cf41379c852326fd37f86e6e7f66665f3464d0ee96faf9f07cd26f5e","last_reissued_at":"2026-07-05T08:43:13.232430Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:13.232430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Static Analysis of Logic Programs via Boolean Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Belaid Benhamou, Van-Giang Trinh","submitted_at":"2024-07-12T06:07:05Z","abstract_excerpt":"Answer Set Programming (ASP) is a declarative problem solving paradigm that can be used to encode a combinatorial problem as a logic program whose stable models correspond to the solutions of the considered problem. ASP has been widely applied to various domains in AI and beyond. The question \"What can be said about stable models of a logic program from its static information?\" has been investigated and proved useful in many circumstances. In this work, we dive into this direction more deeply by making the connection between a logic program and a Boolean network, which is a prominent modeling "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.09015","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/2407.09015/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":"2407.09015","created_at":"2026-07-05T08:43:13.232489+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.09015v1","created_at":"2026-07-05T08:43:13.232489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09015","created_at":"2026-07-05T08:43:13.232489+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYYGO5OPIE3Z","created_at":"2026-07-05T08:43:13.232489+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYYGO5OPIE3ZZBJD","created_at":"2026-07-05T08:43:13.232489+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYYGO5OP","created_at":"2026-07-05T08:43:13.232489+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.15417","citing_title":"On the Boolean Network Theory of Datalog$^\\neg$","ref_index":1973,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYYGO5OPIE3ZZBJDE36TP6DONZ","json":"https://pith.science/pith/BYYGO5OPIE3ZZBJDE36TP6DONZ.json","graph_json":"https://pith.science/api/pith-number/BYYGO5OPIE3ZZBJDE36TP6DONZ/graph.json","events_json":"https://pith.science/api/pith-number/BYYGO5OPIE3ZZBJDE36TP6DONZ/events.json","paper":"https://pith.science/paper/BYYGO5OP"},"agent_actions":{"view_html":"https://pith.science/pith/BYYGO5OPIE3ZZBJDE36TP6DONZ","download_json":"https://pith.science/pith/BYYGO5OPIE3ZZBJDE36TP6DONZ.json","view_paper":"https://pith.science/paper/BYYGO5OP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.09015&json=true","fetch_graph":"https://pith.science/api/pith-number/BYYGO5OPIE3ZZBJDE36TP6DONZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BYYGO5OPIE3ZZBJDE36TP6DONZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYYGO5OPIE3ZZBJDE36TP6DONZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYYGO5OPIE3ZZBJDE36TP6DONZ/action/storage_attestation","attest_author":"https://pith.science/pith/BYYGO5OPIE3ZZBJDE36TP6DONZ/action/author_attestation","sign_citation":"https://pith.science/pith/BYYGO5OPIE3ZZBJDE36TP6DONZ/action/citation_signature","submit_replication":"https://pith.science/pith/BYYGO5OPIE3ZZBJDE36TP6DONZ/action/replication_record"}},"created_at":"2026-07-05T08:43:13.232489+00:00","updated_at":"2026-07-05T08:43:13.232489+00:00"}