{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:STYM4GWG24PGGMHDU7UCMTWAWF","short_pith_number":"pith:STYM4GWG","canonical_record":{"source":{"id":"1011.4377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-19T10:01:17Z","cross_cats_sorted":[],"title_canon_sha256":"b5f69914db7ba2409a7f827ea70db5b80ef02a479d9374ee9eb8df9e395e014d","abstract_canon_sha256":"29ded4a55552cddde27635ed98998ad62a4b5e238a4f6a0d276c0d9fa2566437"},"schema_version":"1.0"},"canonical_sha256":"94f0ce1ac6d71e6330e3a7e8264ec0b14221e82cb9374025d9ee68664b4897ab","source":{"kind":"arxiv","id":"1011.4377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4377","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4377v1","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4377","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"STYM4GWG24PG","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"STYM4GWG24PGGMHD","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"STYM4GWG","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:STYM4GWG24PGGMHDU7UCMTWAWF","target":"record","payload":{"canonical_record":{"source":{"id":"1011.4377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-19T10:01:17Z","cross_cats_sorted":[],"title_canon_sha256":"b5f69914db7ba2409a7f827ea70db5b80ef02a479d9374ee9eb8df9e395e014d","abstract_canon_sha256":"29ded4a55552cddde27635ed98998ad62a4b5e238a4f6a0d276c0d9fa2566437"},"schema_version":"1.0"},"canonical_sha256":"94f0ce1ac6d71e6330e3a7e8264ec0b14221e82cb9374025d9ee68664b4897ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:14.278953Z","signature_b64":"3q9OonmK8DtROgwuK0PzjT95E1/A/6PIcv37OVTjV1zEaB0svLspCsuulm+58ACskThX+mMMuOg3mnlgM0hiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94f0ce1ac6d71e6330e3a7e8264ec0b14221e82cb9374025d9ee68664b4897ab","last_reissued_at":"2026-05-18T04:35:14.278455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:14.278455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.4377","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-18T04:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0kDm1eKV0RpP61QONpNVoOsDN+5riA0D28KaiB9iGl7a60V9wG311tpD9HuxtOw4CtAkZNPu43DhkyItYzksCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:47:41.006956Z"},"content_sha256":"66caf79a9cebeacbd7d89b22a9dfd4d1398654df7ad25ab183b4130e8c43fb76","schema_version":"1.0","event_id":"sha256:66caf79a9cebeacbd7d89b22a9dfd4d1398654df7ad25ab183b4130e8c43fb76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:STYM4GWG24PGGMHDU7UCMTWAWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Magic Sets for Super-Consistent Answer Set Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mario Alviano, Wolfgang Faber","submitted_at":"2010-11-19T10:01:17Z","abstract_excerpt":"For many practical applications of ASP, for instance data integration or planning, query answering is important, and therefore query optimization techniques for ASP are of great interest. Magic Sets are one of these techniques, originally defined for Datalog queries (ASP without disjunction and negation). Dynamic Magic Sets (DMS) are an extension of this technique, which has been proved to be sound and complete for query answering over ASP programs with stratified negation.\n  A distinguishing feature of DMS is that the optimization can be exploited also during the nondeterministic phase of ASP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4377","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-18T04:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LkcM9pbDv/yAw3hKM3OpYrJaaWLs5FSQFzP5X+HlcInkWNmIqqbN8sK+TGpmg3G6Cta+MHOaVxBmpmL7jESCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:47:41.007300Z"},"content_sha256":"447653921a4f90427353c3ac2ed589be3599f6d3f8f57ce65d15cbdf29599159","schema_version":"1.0","event_id":"sha256:447653921a4f90427353c3ac2ed589be3599f6d3f8f57ce65d15cbdf29599159"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STYM4GWG24PGGMHDU7UCMTWAWF/bundle.json","state_url":"https://pith.science/pith/STYM4GWG24PGGMHDU7UCMTWAWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STYM4GWG24PGGMHDU7UCMTWAWF/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-06-01T11:47:41Z","links":{"resolver":"https://pith.science/pith/STYM4GWG24PGGMHDU7UCMTWAWF","bundle":"https://pith.science/pith/STYM4GWG24PGGMHDU7UCMTWAWF/bundle.json","state":"https://pith.science/pith/STYM4GWG24PGGMHDU7UCMTWAWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STYM4GWG24PGGMHDU7UCMTWAWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:STYM4GWG24PGGMHDU7UCMTWAWF","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":"29ded4a55552cddde27635ed98998ad62a4b5e238a4f6a0d276c0d9fa2566437","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-19T10:01:17Z","title_canon_sha256":"b5f69914db7ba2409a7f827ea70db5b80ef02a479d9374ee9eb8df9e395e014d"},"schema_version":"1.0","source":{"id":"1011.4377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4377","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4377v1","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4377","created_at":"2026-05-18T04:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"STYM4GWG24PG","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"STYM4GWG24PGGMHD","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"STYM4GWG","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:447653921a4f90427353c3ac2ed589be3599f6d3f8f57ce65d15cbdf29599159","target":"graph","created_at":"2026-05-18T04:35:14Z","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":"For many practical applications of ASP, for instance data integration or planning, query answering is important, and therefore query optimization techniques for ASP are of great interest. Magic Sets are one of these techniques, originally defined for Datalog queries (ASP without disjunction and negation). Dynamic Magic Sets (DMS) are an extension of this technique, which has been proved to be sound and complete for query answering over ASP programs with stratified negation.\n  A distinguishing feature of DMS is that the optimization can be exploited also during the nondeterministic phase of ASP","authors_text":"Mario Alviano, Wolfgang Faber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-19T10:01:17Z","title":"Dynamic Magic Sets for Super-Consistent Answer Set Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4377","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:66caf79a9cebeacbd7d89b22a9dfd4d1398654df7ad25ab183b4130e8c43fb76","target":"record","created_at":"2026-05-18T04:35:14Z","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":"29ded4a55552cddde27635ed98998ad62a4b5e238a4f6a0d276c0d9fa2566437","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-19T10:01:17Z","title_canon_sha256":"b5f69914db7ba2409a7f827ea70db5b80ef02a479d9374ee9eb8df9e395e014d"},"schema_version":"1.0","source":{"id":"1011.4377","kind":"arxiv","version":1}},"canonical_sha256":"94f0ce1ac6d71e6330e3a7e8264ec0b14221e82cb9374025d9ee68664b4897ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94f0ce1ac6d71e6330e3a7e8264ec0b14221e82cb9374025d9ee68664b4897ab","first_computed_at":"2026-05-18T04:35:14.278455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:14.278455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3q9OonmK8DtROgwuK0PzjT95E1/A/6PIcv37OVTjV1zEaB0svLspCsuulm+58ACskThX+mMMuOg3mnlgM0hiAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:14.278953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66caf79a9cebeacbd7d89b22a9dfd4d1398654df7ad25ab183b4130e8c43fb76","sha256:447653921a4f90427353c3ac2ed589be3599f6d3f8f57ce65d15cbdf29599159"],"state_sha256":"c0d0c11a9ee8415c76753b12cc2e0995b58ec9726b15ebf2c07a13dc2d81f1bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+lkYbGZ27qE6LI9bgQLYSMeAz59BFwOiQwBFMEwH8OfR2Hj6d54Li/vu/8hdigGleQVb76PdnmYu3ESf3Z+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:47:41.009232Z","bundle_sha256":"02537e4ff9e6cd4c9dd3fe2bacd8b090b9b8998e287d742cd7291707e13b8286"}}