{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CM66SBLNN55AL4Q7KZPPSDGTS3","short_pith_number":"pith:CM66SBLN","canonical_record":{"source":{"id":"1008.2121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-12T14:40:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"37018166e7cf2cd0dbfaef87f25964b160843300cfc961b09fc2a54134b935cf","abstract_canon_sha256":"ec2d6ab68c5127250203b5e79ca74e81faf789bed1b1e9f1b209635a2f63da53"},"schema_version":"1.0"},"canonical_sha256":"133de9056d6f7a05f21f565ef90cd396f319194c7416929d592bb240a0323e77","source":{"kind":"arxiv","id":"1008.2121","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2121","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2121v2","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2121","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"pith_short_12","alias_value":"CM66SBLNN55A","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CM66SBLNN55AL4Q7","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CM66SBLN","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CM66SBLNN55AL4Q7KZPPSDGTS3","target":"record","payload":{"canonical_record":{"source":{"id":"1008.2121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-12T14:40:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"37018166e7cf2cd0dbfaef87f25964b160843300cfc961b09fc2a54134b935cf","abstract_canon_sha256":"ec2d6ab68c5127250203b5e79ca74e81faf789bed1b1e9f1b209635a2f63da53"},"schema_version":"1.0"},"canonical_sha256":"133de9056d6f7a05f21f565ef90cd396f319194c7416929d592bb240a0323e77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:43.780507Z","signature_b64":"aIgeDpNpD14ng5i7wfi42rDlOxO/daXZtEOwHGbjR02u339v09dY/TJt9kPs2B6/Mpgq6VEZ6LjSEwQlZancDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"133de9056d6f7a05f21f565ef90cd396f319194c7416929d592bb240a0323e77","last_reissued_at":"2026-05-18T04:18:43.780074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:43.780074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.2121","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-18T04:18:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PnaG3lPYZhnCwzkRIhpvsTdEaVQfhiqw++k172oGhpvJ+4CmNPJTXv5F7cQYpl9OiKsIG/SDGkrC3ssbQuuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:39:01.128606Z"},"content_sha256":"403e0951bb0a2ef43fd7bb0d7d3f37446e61910d6aae44985c54b321b5763ed1","schema_version":"1.0","event_id":"sha256:403e0951bb0a2ef43fd7bb0d7d3f37446e61910d6aae44985c54b321b5763ed1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CM66SBLNN55AL4Q7KZPPSDGTS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint Propagation for First-Order Logic and Inductive Definitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Johan Wittocx, Marc Denecker, Maurice Bruynooghe","submitted_at":"2010-08-12T14:40:04Z","abstract_excerpt":"Constraint propagation is one of the basic forms of inference in many logic-based reasoning systems. In this paper, we investigate constraint propagation for first-order logic (FO), a suitable language to express a wide variety of constraints. We present an algorithm with polynomial-time data complexity for constraint propagation in the context of an FO theory and a finite structure. We show that constraint propagation in this manner can be represented by a datalog program and that the algorithm can be executed symbolically, i.e., independently of a structure. Next, we extend the algorithm to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2121","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-18T04:18:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3SgN+eePqEO5bgnbcxbOc4aVEs3hT62j1ORJb0CJDgHeFMj7bHPOd3hzR8FJR/aKRiMEQ6LxuF8wQsrQXhmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:39:01.128948Z"},"content_sha256":"af374eea4089705f26acc94bc05ec94c60ea5b787da3babe47e90be37c1f827e","schema_version":"1.0","event_id":"sha256:af374eea4089705f26acc94bc05ec94c60ea5b787da3babe47e90be37c1f827e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CM66SBLNN55AL4Q7KZPPSDGTS3/bundle.json","state_url":"https://pith.science/pith/CM66SBLNN55AL4Q7KZPPSDGTS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CM66SBLNN55AL4Q7KZPPSDGTS3/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-05-28T09:39:01Z","links":{"resolver":"https://pith.science/pith/CM66SBLNN55AL4Q7KZPPSDGTS3","bundle":"https://pith.science/pith/CM66SBLNN55AL4Q7KZPPSDGTS3/bundle.json","state":"https://pith.science/pith/CM66SBLNN55AL4Q7KZPPSDGTS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CM66SBLNN55AL4Q7KZPPSDGTS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CM66SBLNN55AL4Q7KZPPSDGTS3","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":"ec2d6ab68c5127250203b5e79ca74e81faf789bed1b1e9f1b209635a2f63da53","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-12T14:40:04Z","title_canon_sha256":"37018166e7cf2cd0dbfaef87f25964b160843300cfc961b09fc2a54134b935cf"},"schema_version":"1.0","source":{"id":"1008.2121","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2121","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2121v2","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2121","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"pith_short_12","alias_value":"CM66SBLNN55A","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CM66SBLNN55AL4Q7","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CM66SBLN","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:af374eea4089705f26acc94bc05ec94c60ea5b787da3babe47e90be37c1f827e","target":"graph","created_at":"2026-05-18T04:18:43Z","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":"Constraint propagation is one of the basic forms of inference in many logic-based reasoning systems. In this paper, we investigate constraint propagation for first-order logic (FO), a suitable language to express a wide variety of constraints. We present an algorithm with polynomial-time data complexity for constraint propagation in the context of an FO theory and a finite structure. We show that constraint propagation in this manner can be represented by a datalog program and that the algorithm can be executed symbolically, i.e., independently of a structure. Next, we extend the algorithm to ","authors_text":"Johan Wittocx, Marc Denecker, Maurice Bruynooghe","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-12T14:40:04Z","title":"Constraint Propagation for First-Order Logic and Inductive Definitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2121","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:403e0951bb0a2ef43fd7bb0d7d3f37446e61910d6aae44985c54b321b5763ed1","target":"record","created_at":"2026-05-18T04:18:43Z","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":"ec2d6ab68c5127250203b5e79ca74e81faf789bed1b1e9f1b209635a2f63da53","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-08-12T14:40:04Z","title_canon_sha256":"37018166e7cf2cd0dbfaef87f25964b160843300cfc961b09fc2a54134b935cf"},"schema_version":"1.0","source":{"id":"1008.2121","kind":"arxiv","version":2}},"canonical_sha256":"133de9056d6f7a05f21f565ef90cd396f319194c7416929d592bb240a0323e77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"133de9056d6f7a05f21f565ef90cd396f319194c7416929d592bb240a0323e77","first_computed_at":"2026-05-18T04:18:43.780074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:43.780074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aIgeDpNpD14ng5i7wfi42rDlOxO/daXZtEOwHGbjR02u339v09dY/TJt9kPs2B6/Mpgq6VEZ6LjSEwQlZancDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:43.780507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2121","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:403e0951bb0a2ef43fd7bb0d7d3f37446e61910d6aae44985c54b321b5763ed1","sha256:af374eea4089705f26acc94bc05ec94c60ea5b787da3babe47e90be37c1f827e"],"state_sha256":"9c3a687476f20c00cf13b64feff8a332a3d27e77d5c6003363bde04e72ea432b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DL2jPEG8adskXfTklmQpo2esfZ+ZKAJvL42Vai7OaNcJFvDskSn4C/GBZObqgQevuoPDRwt9HMG6TB3T1Gn5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:39:01.130954Z","bundle_sha256":"bc4d8cc10aa7c77f8928a227d7d6e1dc74ac4421b4b8a09a41883d7c699c763f"}}