{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MSTNPKGFCEZKLLTJ5TIF7YATA3","short_pith_number":"pith:MSTNPKGF","schema_version":"1.0","canonical_sha256":"64a6d7a8c51132a5ae69ecd05fe01306cb8725f0f0cb9e1dddf82006ba43223c","source":{"kind":"arxiv","id":"1907.10278","version":1},"attestation_state":"computed","paper":{"title":"A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC","cs.LO"],"primary_cat":"cs.PL","authors_text":"Ariyam Das, Carlo Zaniolo","submitted_at":"2019-07-24T07:35:18Z","abstract_excerpt":"A large class of traditional graph and data mining algorithms can be concisely expressed in Datalog, and other Logic-based languages, once aggregates are allowed in recursion. In fact, for most BigData algorithms, the difficult semantic issues raised by the use of non-monotonic aggregates in recursion are solved by Pre-Mappability (PreM), a property that assures that for a program with aggregates in recursion there is an equivalent aggregate-stratified program. In this paper we show that, by bringing together the formal abstract semantics of stratified programs with the efficient operational o"},"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":"1907.10278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-07-24T07:35:18Z","cross_cats_sorted":["cs.DB","cs.DC","cs.LO"],"title_canon_sha256":"97b976de38ace2461b9813e57761d731d079c8da37e22924c40dc598f2a0a9ac","abstract_canon_sha256":"db045ef2254f6b443f044a055b23a9fe730546799abeca0dab20e96d6f643046"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:38.411021Z","signature_b64":"+hWhKrPjpajZFh73YCy2pTSAZl5+4CzZFQ/EIvwS6Xjkmv9Bfr4vy98A/vGeQDGkmanUtYKHSGhpnjAvyKvRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64a6d7a8c51132a5ae69ecd05fe01306cb8725f0f0cb9e1dddf82006ba43223c","last_reissued_at":"2026-05-17T23:39:38.410403Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:38.410403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC","cs.LO"],"primary_cat":"cs.PL","authors_text":"Ariyam Das, Carlo Zaniolo","submitted_at":"2019-07-24T07:35:18Z","abstract_excerpt":"A large class of traditional graph and data mining algorithms can be concisely expressed in Datalog, and other Logic-based languages, once aggregates are allowed in recursion. In fact, for most BigData algorithms, the difficult semantic issues raised by the use of non-monotonic aggregates in recursion are solved by Pre-Mappability (PreM), a property that assures that for a program with aggregates in recursion there is an equivalent aggregate-stratified program. In this paper we show that, by bringing together the formal abstract semantics of stratified programs with the efficient operational o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10278","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":"1907.10278","created_at":"2026-05-17T23:39:38.410503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10278v1","created_at":"2026-05-17T23:39:38.410503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10278","created_at":"2026-05-17T23:39:38.410503+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSTNPKGFCEZK","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSTNPKGFCEZKLLTJ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSTNPKGF","created_at":"2026-05-18T12:33:24.271573+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/MSTNPKGFCEZKLLTJ5TIF7YATA3","json":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3.json","graph_json":"https://pith.science/api/pith-number/MSTNPKGFCEZKLLTJ5TIF7YATA3/graph.json","events_json":"https://pith.science/api/pith-number/MSTNPKGFCEZKLLTJ5TIF7YATA3/events.json","paper":"https://pith.science/paper/MSTNPKGF"},"agent_actions":{"view_html":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3","download_json":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3.json","view_paper":"https://pith.science/paper/MSTNPKGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10278&json=true","fetch_graph":"https://pith.science/api/pith-number/MSTNPKGFCEZKLLTJ5TIF7YATA3/graph.json","fetch_events":"https://pith.science/api/pith-number/MSTNPKGFCEZKLLTJ5TIF7YATA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/action/storage_attestation","attest_author":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/action/author_attestation","sign_citation":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/action/citation_signature","submit_replication":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/action/replication_record"}},"created_at":"2026-05-17T23:39:38.410503+00:00","updated_at":"2026-05-17T23:39:38.410503+00:00"}