{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QTWHSW66C5KOJFXCU3USMKG3NN","short_pith_number":"pith:QTWHSW66","canonical_record":{"source":{"id":"1905.05393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-14T05:01:43Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"48d76357e9a37aafed18a010654d437429c23ffa3a02d6a48b96b19710cac36a","abstract_canon_sha256":"d25c9cc797e1a2adfa83e8b09990787a30e7d8dbb6db4f73411ace59bd715448"},"schema_version":"1.0"},"canonical_sha256":"84ec795bde1754e496e2a6e92628db6b49d1c48f32cdb3fa607d6fcf470c16b1","source":{"kind":"arxiv","id":"1905.05393","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05393","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05393v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05393","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"QTWHSW66C5KO","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QTWHSW66C5KOJFXC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QTWHSW66","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QTWHSW66C5KOJFXCU3USMKG3NN","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-14T05:01:43Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"48d76357e9a37aafed18a010654d437429c23ffa3a02d6a48b96b19710cac36a","abstract_canon_sha256":"d25c9cc797e1a2adfa83e8b09990787a30e7d8dbb6db4f73411ace59bd715448"},"schema_version":"1.0"},"canonical_sha256":"84ec795bde1754e496e2a6e92628db6b49d1c48f32cdb3fa607d6fcf470c16b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:16.631217Z","signature_b64":"L3b/eZUFqDGJgqsna2o/cu3ToDAbbUfPm6JikqrjehkaWS0xqhNw3kM5EdcTIMuXhsbtQ/XE6DB0WqKfIvNOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84ec795bde1754e496e2a6e92628db6b49d1c48f32cdb3fa607d6fcf470c16b1","last_reissued_at":"2026-05-17T23:46:16.630641Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:16.630641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05393","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:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWlDbDCl86hbMTHnjE44EqIFW3xb7DS2C6P2pu3vNbuCI3cBXqijUhh0pRa+AFoYKtH0TSvCngVH2I/8arWbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:04:46.684778Z"},"content_sha256":"bc19c2db5b7274f6bbfe87f5d6ed5876e2e57f41079a5241540d6702e134d3bc","schema_version":"1.0","event_id":"sha256:bc19c2db5b7274f6bbfe87f5d6ed5876e2e57f41079a5241540d6702e134d3bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QTWHSW66C5KOJFXCU3USMKG3NN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Population Based Augmentation: Efficient Learning of Augmentation Policy Schedules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Daniel Ho, Eric Liang, Ion Stoica, Pieter Abbeel, Xi Chen","submitted_at":"2019-05-14T05:01:43Z","abstract_excerpt":"A key challenge in leveraging data augmentation for neural network training is choosing an effective augmentation policy from a large search space of candidate operations. Properly chosen augmentation policies can lead to significant generalization improvements; however, state-of-the-art approaches such as AutoAugment are computationally infeasible to run for the ordinary user. In this paper, we introduce a new data augmentation algorithm, Population Based Augmentation (PBA), which generates nonstationary augmentation policy schedules instead of a fixed augmentation policy. We show that PBA ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05393","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:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELCjtD/geda3SGzQCCMJqGEGB8Ir59jfRgBfMVOcvBJ1yGFOFZfKykX4FCZwdtEdH2IjU+YHhT6q/jZQw4o9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:04:46.685473Z"},"content_sha256":"fad40817e4704c22f341dc3fcf2f42a8e660e31323d18729cd9beba1163e1355","schema_version":"1.0","event_id":"sha256:fad40817e4704c22f341dc3fcf2f42a8e660e31323d18729cd9beba1163e1355"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QTWHSW66C5KOJFXCU3USMKG3NN/bundle.json","state_url":"https://pith.science/pith/QTWHSW66C5KOJFXCU3USMKG3NN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QTWHSW66C5KOJFXCU3USMKG3NN/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-25T22:04:46Z","links":{"resolver":"https://pith.science/pith/QTWHSW66C5KOJFXCU3USMKG3NN","bundle":"https://pith.science/pith/QTWHSW66C5KOJFXCU3USMKG3NN/bundle.json","state":"https://pith.science/pith/QTWHSW66C5KOJFXCU3USMKG3NN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QTWHSW66C5KOJFXCU3USMKG3NN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QTWHSW66C5KOJFXCU3USMKG3NN","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":"d25c9cc797e1a2adfa83e8b09990787a30e7d8dbb6db4f73411ace59bd715448","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-14T05:01:43Z","title_canon_sha256":"48d76357e9a37aafed18a010654d437429c23ffa3a02d6a48b96b19710cac36a"},"schema_version":"1.0","source":{"id":"1905.05393","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05393","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05393v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05393","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"QTWHSW66C5KO","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QTWHSW66C5KOJFXC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QTWHSW66","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:fad40817e4704c22f341dc3fcf2f42a8e660e31323d18729cd9beba1163e1355","target":"graph","created_at":"2026-05-17T23:46:16Z","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 key challenge in leveraging data augmentation for neural network training is choosing an effective augmentation policy from a large search space of candidate operations. Properly chosen augmentation policies can lead to significant generalization improvements; however, state-of-the-art approaches such as AutoAugment are computationally infeasible to run for the ordinary user. In this paper, we introduce a new data augmentation algorithm, Population Based Augmentation (PBA), which generates nonstationary augmentation policy schedules instead of a fixed augmentation policy. We show that PBA ca","authors_text":"Daniel Ho, Eric Liang, Ion Stoica, Pieter Abbeel, Xi Chen","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-14T05:01:43Z","title":"Population Based Augmentation: Efficient Learning of Augmentation Policy Schedules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05393","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:bc19c2db5b7274f6bbfe87f5d6ed5876e2e57f41079a5241540d6702e134d3bc","target":"record","created_at":"2026-05-17T23:46:16Z","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":"d25c9cc797e1a2adfa83e8b09990787a30e7d8dbb6db4f73411ace59bd715448","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-14T05:01:43Z","title_canon_sha256":"48d76357e9a37aafed18a010654d437429c23ffa3a02d6a48b96b19710cac36a"},"schema_version":"1.0","source":{"id":"1905.05393","kind":"arxiv","version":1}},"canonical_sha256":"84ec795bde1754e496e2a6e92628db6b49d1c48f32cdb3fa607d6fcf470c16b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84ec795bde1754e496e2a6e92628db6b49d1c48f32cdb3fa607d6fcf470c16b1","first_computed_at":"2026-05-17T23:46:16.630641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:16.630641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L3b/eZUFqDGJgqsna2o/cu3ToDAbbUfPm6JikqrjehkaWS0xqhNw3kM5EdcTIMuXhsbtQ/XE6DB0WqKfIvNOCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:16.631217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05393","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc19c2db5b7274f6bbfe87f5d6ed5876e2e57f41079a5241540d6702e134d3bc","sha256:fad40817e4704c22f341dc3fcf2f42a8e660e31323d18729cd9beba1163e1355"],"state_sha256":"066c5109cf9703e23c3c640b38caf66626e15544fd5500efc5a87109cd734266"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vxv19SuRAk0z6g0+S0h0frTpTtvu7QA3dnVO1sH8q3ewwZe6vxO7rHOcUGhOs01nGz7KGNZX/HBwfkABsEw6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:04:46.688841Z","bundle_sha256":"a31f53e831dad225da272431ec18ee2b197dc1c10447c81899878794a9d98af1"}}