{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:W7USDALCNM56K77QYHBCGVDH54","short_pith_number":"pith:W7USDALC","canonical_record":{"source":{"id":"1203.0160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-01T11:43:43Z","cross_cats_sorted":["cs.LG","cs.PF"],"title_canon_sha256":"ccabb07b6340282629ed3406d7edf9da8daa9010083c06e8d27e4e348adc9c04","abstract_canon_sha256":"349a292df67178ac569496339911a06f6209d0f262c27e847a5b9389b0c9b70f"},"schema_version":"1.0"},"canonical_sha256":"b7e92181626b3be57ff0c1c2235467ef0e7782e4da023c4a86e10c50c6c3a2b8","source":{"kind":"arxiv","id":"1203.0160","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0160","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0160v2","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0160","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"W7USDALCNM56","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W7USDALCNM56K77Q","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W7USDALC","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:W7USDALCNM56K77QYHBCGVDH54","target":"record","payload":{"canonical_record":{"source":{"id":"1203.0160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-01T11:43:43Z","cross_cats_sorted":["cs.LG","cs.PF"],"title_canon_sha256":"ccabb07b6340282629ed3406d7edf9da8daa9010083c06e8d27e4e348adc9c04","abstract_canon_sha256":"349a292df67178ac569496339911a06f6209d0f262c27e847a5b9389b0c9b70f"},"schema_version":"1.0"},"canonical_sha256":"b7e92181626b3be57ff0c1c2235467ef0e7782e4da023c4a86e10c50c6c3a2b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:01.263986Z","signature_b64":"gtyfVNGUsB9otVnLRedmS6+93dufhWqScWb+pz+np9Oh85e7stAl6BecsVBEiQ9u/S4IVX93yUpFc85ie+9bAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7e92181626b3be57ff0c1c2235467ef0e7782e4da023c4a86e10c50c6c3a2b8","last_reissued_at":"2026-05-18T04:01:01.262876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:01.262876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.0160","source_version":2,"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:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ft+qAIBfGtMADQqUCdHbhlFGsQC3KAHKaL+TYTAwEElF3cD954MZAZJwqaGLf3/vL14ZIl4PPE2IitRwaAiYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:59:21.505504Z"},"content_sha256":"4774dddeb30c4724abebca773063c722bc011971a5e9770728396bd4aa30f4b3","schema_version":"1.0","event_id":"sha256:4774dddeb30c4724abebca773063c722bc011971a5e9770728396bd4aa30f4b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:W7USDALCNM56K77QYHBCGVDH54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Datalog for Machine Learning on Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PF"],"primary_cat":"cs.DB","authors_text":"Joshua Rosen, Markus Weimer, Michael J. Carey, Neoklis Polyzotis, Raghu Ramakrishnan, Tyson Condie, Vinayak Borkar, Yingyi Bu","submitted_at":"2012-03-01T11:43:43Z","abstract_excerpt":"In this paper, we present the case for a declarative foundation for data-intensive machine learning systems. Instead of creating a new system for each specific flavor of machine learning task, or hardcoding new optimizations, we argue for the use of recursive queries to program a variety of machine learning systems. By taking this approach, database query optimization techniques can be utilized to identify effective execution plans, and the resulting runtime plans can be executed on a single unified data-parallel query processing engine. As a proof of concept, we consider two programming model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0160","kind":"arxiv","version":2},"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:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TTUbFCtkIPLBWD8fGGbEtg3ylk2EOzk3kS0flg+NzCocXjfVyYvMBQjQuLAzfxxfGtLHCBaUxgGVb3VXQAlZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:59:21.505861Z"},"content_sha256":"3495cf05b2379903dc9df17fe0bc6d96a453e6d5c715c6c0a5f4759a8967b2df","schema_version":"1.0","event_id":"sha256:3495cf05b2379903dc9df17fe0bc6d96a453e6d5c715c6c0a5f4759a8967b2df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7USDALCNM56K77QYHBCGVDH54/bundle.json","state_url":"https://pith.science/pith/W7USDALCNM56K77QYHBCGVDH54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7USDALCNM56K77QYHBCGVDH54/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-23T05:59:21Z","links":{"resolver":"https://pith.science/pith/W7USDALCNM56K77QYHBCGVDH54","bundle":"https://pith.science/pith/W7USDALCNM56K77QYHBCGVDH54/bundle.json","state":"https://pith.science/pith/W7USDALCNM56K77QYHBCGVDH54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7USDALCNM56K77QYHBCGVDH54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:W7USDALCNM56K77QYHBCGVDH54","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":"349a292df67178ac569496339911a06f6209d0f262c27e847a5b9389b0c9b70f","cross_cats_sorted":["cs.LG","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-01T11:43:43Z","title_canon_sha256":"ccabb07b6340282629ed3406d7edf9da8daa9010083c06e8d27e4e348adc9c04"},"schema_version":"1.0","source":{"id":"1203.0160","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0160","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0160v2","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0160","created_at":"2026-05-18T04:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"W7USDALCNM56","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W7USDALCNM56K77Q","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W7USDALC","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:3495cf05b2379903dc9df17fe0bc6d96a453e6d5c715c6c0a5f4759a8967b2df","target":"graph","created_at":"2026-05-18T04:01:01Z","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":"In this paper, we present the case for a declarative foundation for data-intensive machine learning systems. Instead of creating a new system for each specific flavor of machine learning task, or hardcoding new optimizations, we argue for the use of recursive queries to program a variety of machine learning systems. By taking this approach, database query optimization techniques can be utilized to identify effective execution plans, and the resulting runtime plans can be executed on a single unified data-parallel query processing engine. As a proof of concept, we consider two programming model","authors_text":"Joshua Rosen, Markus Weimer, Michael J. Carey, Neoklis Polyzotis, Raghu Ramakrishnan, Tyson Condie, Vinayak Borkar, Yingyi Bu","cross_cats":["cs.LG","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-01T11:43:43Z","title":"Scaling Datalog for Machine Learning on Big Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0160","kind":"arxiv","version":2},"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:4774dddeb30c4724abebca773063c722bc011971a5e9770728396bd4aa30f4b3","target":"record","created_at":"2026-05-18T04:01:01Z","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":"349a292df67178ac569496339911a06f6209d0f262c27e847a5b9389b0c9b70f","cross_cats_sorted":["cs.LG","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-01T11:43:43Z","title_canon_sha256":"ccabb07b6340282629ed3406d7edf9da8daa9010083c06e8d27e4e348adc9c04"},"schema_version":"1.0","source":{"id":"1203.0160","kind":"arxiv","version":2}},"canonical_sha256":"b7e92181626b3be57ff0c1c2235467ef0e7782e4da023c4a86e10c50c6c3a2b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7e92181626b3be57ff0c1c2235467ef0e7782e4da023c4a86e10c50c6c3a2b8","first_computed_at":"2026-05-18T04:01:01.262876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:01.262876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gtyfVNGUsB9otVnLRedmS6+93dufhWqScWb+pz+np9Oh85e7stAl6BecsVBEiQ9u/S4IVX93yUpFc85ie+9bAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:01.263986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0160","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4774dddeb30c4724abebca773063c722bc011971a5e9770728396bd4aa30f4b3","sha256:3495cf05b2379903dc9df17fe0bc6d96a453e6d5c715c6c0a5f4759a8967b2df"],"state_sha256":"826255e9611a4767587a707db5767e9f4916b62a454bf06bebf7003d13aff4cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0709azdPuRb2RzGWLZYdg4EvUAqZ7JXqlMsaiQl5i1z8mPwO+1ywrZK0SsLaj43bOdH4b/bPAEfx2oDvFvn0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T05:59:21.507845Z","bundle_sha256":"c9a76bc93fcf49391dcfff880ac7fedf610d78a928e0b8058844760608398fb6"}}