{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OR6VK3JPHRM4QTIIVNCQDFHY5L","short_pith_number":"pith:OR6VK3JP","canonical_record":{"source":{"id":"1605.07723","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T04:14:59Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"04d2d0e96655a824f61fc3c40878d36648126a37f4192ebdffcb150e0aea1608","abstract_canon_sha256":"3082fbe4cbae221eb851765920b1a7ec21d90769744f9793d9fccf696dfa4dfe"},"schema_version":"1.0"},"canonical_sha256":"747d556d2f3c59c84d08ab450194f8eae44d5948388dbe8e37fc38e20bb38f56","source":{"kind":"arxiv","id":"1605.07723","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07723","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07723v3","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07723","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"OR6VK3JPHRM4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OR6VK3JPHRM4QTII","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OR6VK3JP","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OR6VK3JPHRM4QTIIVNCQDFHY5L","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07723","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T04:14:59Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"04d2d0e96655a824f61fc3c40878d36648126a37f4192ebdffcb150e0aea1608","abstract_canon_sha256":"3082fbe4cbae221eb851765920b1a7ec21d90769744f9793d9fccf696dfa4dfe"},"schema_version":"1.0"},"canonical_sha256":"747d556d2f3c59c84d08ab450194f8eae44d5948388dbe8e37fc38e20bb38f56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:54.856657Z","signature_b64":"FxWLB7x7vH3zIUtIUTLy5Qfz2Dd5RwMPwYSUWooYWgNy01fdNEqcnub9SHHwZOoBkqCYMZWNAMlyOjtsfAy1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"747d556d2f3c59c84d08ab450194f8eae44d5948388dbe8e37fc38e20bb38f56","last_reissued_at":"2026-05-17T23:58:54.856265Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:54.856265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07723","source_version":3,"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:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snIsaVf7Opq9tAuwAv3vtkA4N4hEvmqe0syb8yoON8C9Bb61ADai0A2+yxb7R0IBXekp5kHoJaUqAJH/lIuhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:02:36.643062Z"},"content_sha256":"3181cceacfc24a03f9a75a91552dbc1b61a56c06361ead6e6aba9b976254af31","schema_version":"1.0","event_id":"sha256:3181cceacfc24a03f9a75a91552dbc1b61a56c06361ead6e6aba9b976254af31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OR6VK3JPHRM4QTIIVNCQDFHY5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Programming: Creating Large Training Sets, Quickly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexander Ratner, Christopher De Sa, Christopher R\\'e, Daniel Selsam, Sen Wu","submitted_at":"2016-05-25T04:14:59Z","abstract_excerpt":"Large labeled training sets are the critical building blocks of supervised learning methods and are key enablers of deep learning techniques. For some applications, creating labeled training sets is the most time-consuming and expensive part of applying machine learning. We therefore propose a paradigm for the programmatic creation of training sets called data programming in which users express weak supervision strategies or domain heuristics as labeling functions, which are programs that label subsets of the data, but that are noisy and may conflict. We show that by explicitly representing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07723","kind":"arxiv","version":3},"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:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZ/ZYYh6qMZIBwnCwgL5WhvyL+vXEwLS7hofS2JN5UiTUoAVWak84fk1MXWdKz5HFGkl2Hi4Ig2PmHBBrlOnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:02:36.643424Z"},"content_sha256":"a9d707f67742603d17cf7bf56635586d510e03c0b2181c5128cf95a7ff1fd0b9","schema_version":"1.0","event_id":"sha256:a9d707f67742603d17cf7bf56635586d510e03c0b2181c5128cf95a7ff1fd0b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OR6VK3JPHRM4QTIIVNCQDFHY5L/bundle.json","state_url":"https://pith.science/pith/OR6VK3JPHRM4QTIIVNCQDFHY5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OR6VK3JPHRM4QTIIVNCQDFHY5L/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-05-22T00:02:36Z","links":{"resolver":"https://pith.science/pith/OR6VK3JPHRM4QTIIVNCQDFHY5L","bundle":"https://pith.science/pith/OR6VK3JPHRM4QTIIVNCQDFHY5L/bundle.json","state":"https://pith.science/pith/OR6VK3JPHRM4QTIIVNCQDFHY5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OR6VK3JPHRM4QTIIVNCQDFHY5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OR6VK3JPHRM4QTIIVNCQDFHY5L","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":"3082fbe4cbae221eb851765920b1a7ec21d90769744f9793d9fccf696dfa4dfe","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T04:14:59Z","title_canon_sha256":"04d2d0e96655a824f61fc3c40878d36648126a37f4192ebdffcb150e0aea1608"},"schema_version":"1.0","source":{"id":"1605.07723","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07723","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07723v3","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07723","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"OR6VK3JPHRM4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OR6VK3JPHRM4QTII","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OR6VK3JP","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:a9d707f67742603d17cf7bf56635586d510e03c0b2181c5128cf95a7ff1fd0b9","target":"graph","created_at":"2026-05-17T23:58:54Z","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":"Large labeled training sets are the critical building blocks of supervised learning methods and are key enablers of deep learning techniques. For some applications, creating labeled training sets is the most time-consuming and expensive part of applying machine learning. We therefore propose a paradigm for the programmatic creation of training sets called data programming in which users express weak supervision strategies or domain heuristics as labeling functions, which are programs that label subsets of the data, but that are noisy and may conflict. We show that by explicitly representing th","authors_text":"Alexander Ratner, Christopher De Sa, Christopher R\\'e, Daniel Selsam, Sen Wu","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T04:14:59Z","title":"Data Programming: Creating Large Training Sets, Quickly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07723","kind":"arxiv","version":3},"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:3181cceacfc24a03f9a75a91552dbc1b61a56c06361ead6e6aba9b976254af31","target":"record","created_at":"2026-05-17T23:58:54Z","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":"3082fbe4cbae221eb851765920b1a7ec21d90769744f9793d9fccf696dfa4dfe","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-25T04:14:59Z","title_canon_sha256":"04d2d0e96655a824f61fc3c40878d36648126a37f4192ebdffcb150e0aea1608"},"schema_version":"1.0","source":{"id":"1605.07723","kind":"arxiv","version":3}},"canonical_sha256":"747d556d2f3c59c84d08ab450194f8eae44d5948388dbe8e37fc38e20bb38f56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"747d556d2f3c59c84d08ab450194f8eae44d5948388dbe8e37fc38e20bb38f56","first_computed_at":"2026-05-17T23:58:54.856265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:54.856265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FxWLB7x7vH3zIUtIUTLy5Qfz2Dd5RwMPwYSUWooYWgNy01fdNEqcnub9SHHwZOoBkqCYMZWNAMlyOjtsfAy1Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:54.856657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07723","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3181cceacfc24a03f9a75a91552dbc1b61a56c06361ead6e6aba9b976254af31","sha256:a9d707f67742603d17cf7bf56635586d510e03c0b2181c5128cf95a7ff1fd0b9"],"state_sha256":"7492b037747e66de24dde99b529f8fe78c23ec5adadba19ddfcfa30bcb92e94c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjTGnl0Crgz0syqIh+iMMDeXcw3iUWWT4Ds1F9HzWPxQVTHtT+RJvcampiDISs4ZYxuXtMqqJjnrKmA94kBvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T00:02:36.646179Z","bundle_sha256":"a6204161781aed7f38eaef32d4aef2fad213419e85f35d4aa9a827fd966f8281"}}