{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MSTNPKGFCEZKLLTJ5TIF7YATA3","short_pith_number":"pith:MSTNPKGF","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"},"canonical_sha256":"64a6d7a8c51132a5ae69ecd05fe01306cb8725f0f0cb9e1dddf82006ba43223c","source":{"kind":"arxiv","id":"1907.10278","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10278","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10278v1","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10278","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"MSTNPKGFCEZK","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MSTNPKGFCEZKLLTJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MSTNPKGF","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MSTNPKGFCEZKLLTJ5TIF7YATA3","target":"record","payload":{"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"},"canonical_sha256":"64a6d7a8c51132a5ae69ecd05fe01306cb8725f0f0cb9e1dddf82006ba43223c","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"},"source_kind":"arxiv","source_id":"1907.10278","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-17T23:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/aAwHuV1SkOXgAgQkXoUwz9zkME4rnPJI6KE6xyFfeZHrRot9GR2aDm6KFwAnE/pNEepF/8l5EIogEIckm9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:40:24.677890Z"},"content_sha256":"74ec003f72c5a8b68ec8f1526af06932ef416e427a1be5c4ee767395923db375","schema_version":"1.0","event_id":"sha256:74ec003f72c5a8b68ec8f1526af06932ef416e427a1be5c4ee767395923db375"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MSTNPKGFCEZKLLTJ5TIF7YATA3","target":"graph","payload":{"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"},"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-17T23:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1DcfQPEpK11ZhAfH6TGfrbH7JNAt2b7VGAqazWZqoJFugn9KLdUP2veer/2oIuBjw7VUzQ2RQKdm6dsGTsiIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:40:24.678551Z"},"content_sha256":"e837824cfd0acdeecb528705725943dca45c4ae7649dfd3a6ef7ddbbaf802f1e","schema_version":"1.0","event_id":"sha256:e837824cfd0acdeecb528705725943dca45c4ae7649dfd3a6ef7ddbbaf802f1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/bundle.json","state_url":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/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-11T19:40:24Z","links":{"resolver":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3","bundle":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/bundle.json","state":"https://pith.science/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSTNPKGFCEZKLLTJ5TIF7YATA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MSTNPKGFCEZKLLTJ5TIF7YATA3","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":"db045ef2254f6b443f044a055b23a9fe730546799abeca0dab20e96d6f643046","cross_cats_sorted":["cs.DB","cs.DC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-07-24T07:35:18Z","title_canon_sha256":"97b976de38ace2461b9813e57761d731d079c8da37e22924c40dc598f2a0a9ac"},"schema_version":"1.0","source":{"id":"1907.10278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10278","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10278v1","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10278","created_at":"2026-05-17T23:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"MSTNPKGFCEZK","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MSTNPKGFCEZKLLTJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MSTNPKGF","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:e837824cfd0acdeecb528705725943dca45c4ae7649dfd3a6ef7ddbbaf802f1e","target":"graph","created_at":"2026-05-17T23:39:38Z","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":"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","authors_text":"Ariyam Das, Carlo Zaniolo","cross_cats":["cs.DB","cs.DC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-07-24T07:35:18Z","title":"A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10278","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:74ec003f72c5a8b68ec8f1526af06932ef416e427a1be5c4ee767395923db375","target":"record","created_at":"2026-05-17T23:39:38Z","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":"db045ef2254f6b443f044a055b23a9fe730546799abeca0dab20e96d6f643046","cross_cats_sorted":["cs.DB","cs.DC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-07-24T07:35:18Z","title_canon_sha256":"97b976de38ace2461b9813e57761d731d079c8da37e22924c40dc598f2a0a9ac"},"schema_version":"1.0","source":{"id":"1907.10278","kind":"arxiv","version":1}},"canonical_sha256":"64a6d7a8c51132a5ae69ecd05fe01306cb8725f0f0cb9e1dddf82006ba43223c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64a6d7a8c51132a5ae69ecd05fe01306cb8725f0f0cb9e1dddf82006ba43223c","first_computed_at":"2026-05-17T23:39:38.410403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:38.410403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+hWhKrPjpajZFh73YCy2pTSAZl5+4CzZFQ/EIvwS6Xjkmv9Bfr4vy98A/vGeQDGkmanUtYKHSGhpnjAvyKvRBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:38.411021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74ec003f72c5a8b68ec8f1526af06932ef416e427a1be5c4ee767395923db375","sha256:e837824cfd0acdeecb528705725943dca45c4ae7649dfd3a6ef7ddbbaf802f1e"],"state_sha256":"4ff06c4749f510ea22a7497ef1d12aa4cae0a6ba3be678906a47b6bdef5be695"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OtlTmUBNw1HsHmCmOJ7rW+pVysuvUGk9uTB2YcNMYnLZdmTts1bKTp8LBlpterYkxe7jKAAtTyeaEKdegeD2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:40:24.681771Z","bundle_sha256":"e831573a30ef77eae07565592598f6c255e8be7436454126b05861cfa1019949"}}