{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M3RONWZYGESZ32O4XB627FPQIM","short_pith_number":"pith:M3RONWZY","schema_version":"1.0","canonical_sha256":"66e2e6db3831259de9dcb87daf95f043246697ac2f1a81a8d2f7cd8b71a2c27e","source":{"kind":"arxiv","id":"1804.09473","version":1},"attestation_state":"computed","paper":{"title":"Stratified Negation in Limit Datalog Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Bernardo Cuenca Grau, Boris Motik, Egor V. Kostylev, Ian Horrocks, Mark Kaminski","submitted_at":"2018-04-25T10:40:40Z","abstract_excerpt":"There has recently been an increasing interest in declarative data analysis, where analytic tasks are specified using a logical language, and their implementation and optimisation are delegated to a general-purpose query engine. Existing declarative languages for data analysis can be formalised as variants of logic programming equipped with arithmetic function symbols and/or aggregation, and are typically undecidable. In prior work, the language of $\\mathit{limit\\ programs}$ was proposed, which is sufficiently powerful to capture many analysis tasks and has decidable entailment problem. Rules "},"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":"1804.09473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-04-25T10:40:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"59982088df1e75522714e3d1be690f91b60df6649320f9bfb5e5ff9e1fde47b5","abstract_canon_sha256":"337cb2dc4701cba1f92f1434e0d34272925bbb5ccd595b05a49b14c2668c5184"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:31.688687Z","signature_b64":"cl/2sczU7boUV3/BPJ06IWfiM5YOjuDjMsVWaM8vijHqISM4RrsLD1SkZWdHKbcopvZUzgwil63kukayYAXAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66e2e6db3831259de9dcb87daf95f043246697ac2f1a81a8d2f7cd8b71a2c27e","last_reissued_at":"2026-05-18T00:17:31.688146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:31.688146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stratified Negation in Limit Datalog Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Bernardo Cuenca Grau, Boris Motik, Egor V. Kostylev, Ian Horrocks, Mark Kaminski","submitted_at":"2018-04-25T10:40:40Z","abstract_excerpt":"There has recently been an increasing interest in declarative data analysis, where analytic tasks are specified using a logical language, and their implementation and optimisation are delegated to a general-purpose query engine. Existing declarative languages for data analysis can be formalised as variants of logic programming equipped with arithmetic function symbols and/or aggregation, and are typically undecidable. In prior work, the language of $\\mathit{limit\\ programs}$ was proposed, which is sufficiently powerful to capture many analysis tasks and has decidable entailment problem. Rules "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09473","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.09473","created_at":"2026-05-18T00:17:31.688227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09473v1","created_at":"2026-05-18T00:17:31.688227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09473","created_at":"2026-05-18T00:17:31.688227+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3RONWZYGESZ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3RONWZYGESZ32O4","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3RONWZY","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M3RONWZYGESZ32O4XB627FPQIM","json":"https://pith.science/pith/M3RONWZYGESZ32O4XB627FPQIM.json","graph_json":"https://pith.science/api/pith-number/M3RONWZYGESZ32O4XB627FPQIM/graph.json","events_json":"https://pith.science/api/pith-number/M3RONWZYGESZ32O4XB627FPQIM/events.json","paper":"https://pith.science/paper/M3RONWZY"},"agent_actions":{"view_html":"https://pith.science/pith/M3RONWZYGESZ32O4XB627FPQIM","download_json":"https://pith.science/pith/M3RONWZYGESZ32O4XB627FPQIM.json","view_paper":"https://pith.science/paper/M3RONWZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09473&json=true","fetch_graph":"https://pith.science/api/pith-number/M3RONWZYGESZ32O4XB627FPQIM/graph.json","fetch_events":"https://pith.science/api/pith-number/M3RONWZYGESZ32O4XB627FPQIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3RONWZYGESZ32O4XB627FPQIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3RONWZYGESZ32O4XB627FPQIM/action/storage_attestation","attest_author":"https://pith.science/pith/M3RONWZYGESZ32O4XB627FPQIM/action/author_attestation","sign_citation":"https://pith.science/pith/M3RONWZYGESZ32O4XB627FPQIM/action/citation_signature","submit_replication":"https://pith.science/pith/M3RONWZYGESZ32O4XB627FPQIM/action/replication_record"}},"created_at":"2026-05-18T00:17:31.688227+00:00","updated_at":"2026-05-18T00:17:31.688227+00:00"}