{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UFQNOCHLGODTVVYUVB2E424XIK","short_pith_number":"pith:UFQNOCHL","canonical_record":{"source":{"id":"1404.7205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-29T01:03:19Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"984ab9d142e3ca4c9158db4b82d8b356cadef00ca516f0f14d3515380e16f3f8","abstract_canon_sha256":"d443c2774ef79ad3e8a3e0b27093cd09c6319fed2e6f2570b7279cd006453fd2"},"schema_version":"1.0"},"canonical_sha256":"a160d708eb33873ad714a8744e6b9742b0c7562577981e976e02a7f83824f984","source":{"kind":"arxiv","id":"1404.7205","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7205","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7205v1","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7205","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"UFQNOCHLGODT","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UFQNOCHLGODTVVYU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UFQNOCHL","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UFQNOCHLGODTVVYUVB2E424XIK","target":"record","payload":{"canonical_record":{"source":{"id":"1404.7205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-29T01:03:19Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"984ab9d142e3ca4c9158db4b82d8b356cadef00ca516f0f14d3515380e16f3f8","abstract_canon_sha256":"d443c2774ef79ad3e8a3e0b27093cd09c6319fed2e6f2570b7279cd006453fd2"},"schema_version":"1.0"},"canonical_sha256":"a160d708eb33873ad714a8744e6b9742b0c7562577981e976e02a7f83824f984","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:57.239206Z","signature_b64":"GtifOxcvCvEoKpro1AyVzZr0e8RSdLNKsMLz00wNgUiNMHoOEgbtbZFQDCzXnM4E60yXq5aP/HOS/zdn/xafDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a160d708eb33873ad714a8744e6b9742b0c7562577981e976e02a7f83824f984","last_reissued_at":"2026-05-18T02:52:57.238550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:57.238550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.7205","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-18T02:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MSAXUUTWYa5kzH/4ZjVnZ3qbobgvVepY73vYQf8Dh+1UsAlRVn1q9tiDyObNR3TPneuIosWWvvPkttilUC74DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T18:33:17.825325Z"},"content_sha256":"ea25a454827e0ddcfd98be8ba92ef4080db8bcbc9193d731ac31f1376909525f","schema_version":"1.0","event_id":"sha256:ea25a454827e0ddcfd98be8ba92ef4080db8bcbc9193d731ac31f1376909525f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UFQNOCHLGODTVVYUVB2E424XIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalizing Modular Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Carlos Dam\\'asio, Jo\\~ao Moura","submitted_at":"2014-04-29T01:03:19Z","abstract_excerpt":"Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set Programming, a prominent rule-based declarative programming paradigm. A major approach is Oikarinnen and Janhunen's Gaifman-Shapiro-style architecture of program modules, which provides the composition of program modules. Their module theorem properly strengthens Lifschitz and Turner's splitting set theorem for normal logic programs. However, this approach is limited by module conditions that are imposed in order to ensure the compatib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7205","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-18T02:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cg0vVUP6QQRNj2sSedLw6qNZvewsHU6oXqO8+GtlVy4fDWy/iFholhZ99Fv9sKz4SsqGwKv+e+oSXhx9NB4GDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T18:33:17.825769Z"},"content_sha256":"c1d2eba8d2af6da9c2df007eba5ed216020af332be0f20f985b2865b24fb07bc","schema_version":"1.0","event_id":"sha256:c1d2eba8d2af6da9c2df007eba5ed216020af332be0f20f985b2865b24fb07bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFQNOCHLGODTVVYUVB2E424XIK/bundle.json","state_url":"https://pith.science/pith/UFQNOCHLGODTVVYUVB2E424XIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFQNOCHLGODTVVYUVB2E424XIK/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-08-23T18:33:17Z","links":{"resolver":"https://pith.science/pith/UFQNOCHLGODTVVYUVB2E424XIK","bundle":"https://pith.science/pith/UFQNOCHLGODTVVYUVB2E424XIK/bundle.json","state":"https://pith.science/pith/UFQNOCHLGODTVVYUVB2E424XIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFQNOCHLGODTVVYUVB2E424XIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UFQNOCHLGODTVVYUVB2E424XIK","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":"d443c2774ef79ad3e8a3e0b27093cd09c6319fed2e6f2570b7279cd006453fd2","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-29T01:03:19Z","title_canon_sha256":"984ab9d142e3ca4c9158db4b82d8b356cadef00ca516f0f14d3515380e16f3f8"},"schema_version":"1.0","source":{"id":"1404.7205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7205","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7205v1","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7205","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"UFQNOCHLGODT","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UFQNOCHLGODTVVYU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UFQNOCHL","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:c1d2eba8d2af6da9c2df007eba5ed216020af332be0f20f985b2865b24fb07bc","target":"graph","created_at":"2026-05-18T02:52:57Z","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":"Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set Programming, a prominent rule-based declarative programming paradigm. A major approach is Oikarinnen and Janhunen's Gaifman-Shapiro-style architecture of program modules, which provides the composition of program modules. Their module theorem properly strengthens Lifschitz and Turner's splitting set theorem for normal logic programs. However, this approach is limited by module conditions that are imposed in order to ensure the compatib","authors_text":"Carlos Dam\\'asio, Jo\\~ao Moura","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-29T01:03:19Z","title":"Generalizing Modular Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7205","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:ea25a454827e0ddcfd98be8ba92ef4080db8bcbc9193d731ac31f1376909525f","target":"record","created_at":"2026-05-18T02:52:57Z","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":"d443c2774ef79ad3e8a3e0b27093cd09c6319fed2e6f2570b7279cd006453fd2","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-29T01:03:19Z","title_canon_sha256":"984ab9d142e3ca4c9158db4b82d8b356cadef00ca516f0f14d3515380e16f3f8"},"schema_version":"1.0","source":{"id":"1404.7205","kind":"arxiv","version":1}},"canonical_sha256":"a160d708eb33873ad714a8744e6b9742b0c7562577981e976e02a7f83824f984","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a160d708eb33873ad714a8744e6b9742b0c7562577981e976e02a7f83824f984","first_computed_at":"2026-05-18T02:52:57.238550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:57.238550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GtifOxcvCvEoKpro1AyVzZr0e8RSdLNKsMLz00wNgUiNMHoOEgbtbZFQDCzXnM4E60yXq5aP/HOS/zdn/xafDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:57.239206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea25a454827e0ddcfd98be8ba92ef4080db8bcbc9193d731ac31f1376909525f","sha256:c1d2eba8d2af6da9c2df007eba5ed216020af332be0f20f985b2865b24fb07bc"],"state_sha256":"dbc5d374f7f28cec26e188f40cba2bf138cd9cc7d581a82b0b6b7ce6273fa0d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81hmBxNHH+Sucd+S4HphDYFiY0i83tFi+dGCGTavT3Q1TmZwlZ8Y8/FveyHEshQhStMiMMLWM7xMNyoydr+DCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T18:33:17.830492Z","bundle_sha256":"f11230cce5038dd340f96e077210d9d4d0f56681c110abfed0ab52ab44f36d33"}}