{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IDIMHIO52PMDBASIKT6SQVKULR","short_pith_number":"pith:IDIMHIO5","canonical_record":{"source":{"id":"1503.07717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-26T12:57:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b128c471b9c429e2fccce56c14c3aef40989ed2d536efac123dee629f848bdf0","abstract_canon_sha256":"c03d43870620f0fe172044ed0f6ce75a32b36315d8e02a97c7df08b4e384d000"},"schema_version":"1.0"},"canonical_sha256":"40d0c3a1ddd3d830824854fd2855545c52914ef6ac30c9758052a7b620273364","source":{"kind":"arxiv","id":"1503.07717","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07717","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07717v2","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07717","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"IDIMHIO52PMD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IDIMHIO52PMDBASI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IDIMHIO5","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IDIMHIO52PMDBASIKT6SQVKULR","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-26T12:57:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b128c471b9c429e2fccce56c14c3aef40989ed2d536efac123dee629f848bdf0","abstract_canon_sha256":"c03d43870620f0fe172044ed0f6ce75a32b36315d8e02a97c7df08b4e384d000"},"schema_version":"1.0"},"canonical_sha256":"40d0c3a1ddd3d830824854fd2855545c52914ef6ac30c9758052a7b620273364","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:35.962395Z","signature_b64":"FXcC3cqkNXlShBElkVFvQ+QWuKQ+aaSnbZkBhSs+UKb/qKIVbSJZfsJo4utOIIfHEmh5IQoqZX5svE4LyHC5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40d0c3a1ddd3d830824854fd2855545c52914ef6ac30c9758052a7b620273364","last_reissued_at":"2026-05-18T00:58:35.961694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:35.961694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07717","source_version":2,"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-18T00:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X49dRRTQ4mk1A3RGinZjBdpyGrqT26VXobPaMXUr6nrmZJqhFPQGb73ElureF9Fz0wBvG75Rw5Ydb4xqAe8TDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:14:21.314205Z"},"content_sha256":"527146d7f8e4ec1ab3e154d2a1dd34322e746eb8283ba555cf4c1498c51dc188","schema_version":"1.0","event_id":"sha256:527146d7f8e4ec1ab3e154d2a1dd34322e746eb8283ba555cf4c1498c51dc188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IDIMHIO52PMDBASIKT6SQVKULR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ASPeRiX, a First Order Forward Chaining Approach for Answer Set Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Christopher B\\'eatrix, Claire Lef\\`evre, Igor St\\'ephan, Laurent Garcia","submitted_at":"2015-03-26T12:57:22Z","abstract_excerpt":"The natural way to use Answer Set Programming (ASP) to represent knowledge in Artificial Intelligence or to solve a combinatorial problem is to elaborate a first order logic program with default negation. In a preliminary step this program with variables is translated in an equivalent propositional one by a first tool: the grounder. Then, the propositional program is given to a second tool: the solver. This last one computes (if they exist) one or many answer sets (stable models) of the program, each answer set encoding one solution of the initial problem. Until today, almost all ASP systems a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07717","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":""},"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-18T00:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1xcKfSWoQIxUICrNWD4v6IYG6G3QJRqj+nNze4eI0rqUXK3JeJghQ47Xnu3HJwCDvoxl22EuGMVGAh9UImieBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:14:21.314575Z"},"content_sha256":"af2aaeb7bb3c36a152426d0083bde1d5a9f5ad6e2b15270763bf7e7629a1a7bc","schema_version":"1.0","event_id":"sha256:af2aaeb7bb3c36a152426d0083bde1d5a9f5ad6e2b15270763bf7e7629a1a7bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDIMHIO52PMDBASIKT6SQVKULR/bundle.json","state_url":"https://pith.science/pith/IDIMHIO52PMDBASIKT6SQVKULR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDIMHIO52PMDBASIKT6SQVKULR/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-07-03T09:14:21Z","links":{"resolver":"https://pith.science/pith/IDIMHIO52PMDBASIKT6SQVKULR","bundle":"https://pith.science/pith/IDIMHIO52PMDBASIKT6SQVKULR/bundle.json","state":"https://pith.science/pith/IDIMHIO52PMDBASIKT6SQVKULR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDIMHIO52PMDBASIKT6SQVKULR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IDIMHIO52PMDBASIKT6SQVKULR","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":"c03d43870620f0fe172044ed0f6ce75a32b36315d8e02a97c7df08b4e384d000","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-26T12:57:22Z","title_canon_sha256":"b128c471b9c429e2fccce56c14c3aef40989ed2d536efac123dee629f848bdf0"},"schema_version":"1.0","source":{"id":"1503.07717","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07717","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07717v2","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07717","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"IDIMHIO52PMD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IDIMHIO52PMDBASI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IDIMHIO5","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:af2aaeb7bb3c36a152426d0083bde1d5a9f5ad6e2b15270763bf7e7629a1a7bc","target":"graph","created_at":"2026-05-18T00:58:35Z","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":"The natural way to use Answer Set Programming (ASP) to represent knowledge in Artificial Intelligence or to solve a combinatorial problem is to elaborate a first order logic program with default negation. In a preliminary step this program with variables is translated in an equivalent propositional one by a first tool: the grounder. Then, the propositional program is given to a second tool: the solver. This last one computes (if they exist) one or many answer sets (stable models) of the program, each answer set encoding one solution of the initial problem. Until today, almost all ASP systems a","authors_text":"Christopher B\\'eatrix, Claire Lef\\`evre, Igor St\\'ephan, Laurent Garcia","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-26T12:57:22Z","title":"ASPeRiX, a First Order Forward Chaining Approach for Answer Set Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07717","kind":"arxiv","version":2},"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:527146d7f8e4ec1ab3e154d2a1dd34322e746eb8283ba555cf4c1498c51dc188","target":"record","created_at":"2026-05-18T00:58:35Z","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":"c03d43870620f0fe172044ed0f6ce75a32b36315d8e02a97c7df08b4e384d000","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-26T12:57:22Z","title_canon_sha256":"b128c471b9c429e2fccce56c14c3aef40989ed2d536efac123dee629f848bdf0"},"schema_version":"1.0","source":{"id":"1503.07717","kind":"arxiv","version":2}},"canonical_sha256":"40d0c3a1ddd3d830824854fd2855545c52914ef6ac30c9758052a7b620273364","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40d0c3a1ddd3d830824854fd2855545c52914ef6ac30c9758052a7b620273364","first_computed_at":"2026-05-18T00:58:35.961694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:35.961694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FXcC3cqkNXlShBElkVFvQ+QWuKQ+aaSnbZkBhSs+UKb/qKIVbSJZfsJo4utOIIfHEmh5IQoqZX5svE4LyHC5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:35.962395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07717","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:527146d7f8e4ec1ab3e154d2a1dd34322e746eb8283ba555cf4c1498c51dc188","sha256:af2aaeb7bb3c36a152426d0083bde1d5a9f5ad6e2b15270763bf7e7629a1a7bc"],"state_sha256":"ab0ebb8b91ec099c7e41dbd44fd435e355bd90336b6a245c21f5ee1fc2cdd13e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7jtS+D7oUpPVRA+iGiDWGaCnqU8uhw4cujs8C4FUOkZA25stvcrBz3dnyDbpUJi/PQwY2yZzc+c0zf9vA+UBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:14:21.316449Z","bundle_sha256":"3045390bd04eca6e1c46d9643bd175c6632d58f04a2a034b67a2c6ce3f39f42c"}}