{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LMUKAVVYT44N7VVTL3K44OMEIL","short_pith_number":"pith:LMUKAVVY","canonical_record":{"source":{"id":"1811.04768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-12T15:14:18Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"fa6f529315b31e9b1fb6291a281bc4a3690e60b46abb608b71556c5f694906e2","abstract_canon_sha256":"fd7eb0eae17b7227234b13db291cd76fd00747440c21c75a1561ce835cd46aec"},"schema_version":"1.0"},"canonical_sha256":"5b28a056b89f38dfd6b35ed5ce398442dd00c594a7d7c8fa7e9ff47209bcca1c","source":{"kind":"arxiv","id":"1811.04768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04768","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04768v1","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04768","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"pith_short_12","alias_value":"LMUKAVVYT44N","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LMUKAVVYT44N7VVT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LMUKAVVY","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LMUKAVVYT44N7VVTL3K44OMEIL","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-12T15:14:18Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"fa6f529315b31e9b1fb6291a281bc4a3690e60b46abb608b71556c5f694906e2","abstract_canon_sha256":"fd7eb0eae17b7227234b13db291cd76fd00747440c21c75a1561ce835cd46aec"},"schema_version":"1.0"},"canonical_sha256":"5b28a056b89f38dfd6b35ed5ce398442dd00c594a7d7c8fa7e9ff47209bcca1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:04.102236Z","signature_b64":"J4+ukugoYtACXXmkGakK0UpNvcwBqWEWlBn7/QAhJDmb2k5E2oeifqpbCvoyF2uJZWq3rETjRoiIGSqFiMTcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b28a056b89f38dfd6b35ed5ce398442dd00c594a7d7c8fa7e9ff47209bcca1c","last_reissued_at":"2026-05-18T00:01:04.101691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:04.101691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04768","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-18T00:01:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UdTZyHM1itZtLxUs6F3FzpoLJ2y1xKa8RgtFZjapahcDA3oqnYu1Pqf2f3/WYRha7tLR1Un7vS0sUKQ9yYQNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:22:40.586732Z"},"content_sha256":"12c456e62eb3c5721e10135e29ea8005c9c8064380de33d98d5d81ad92119a5e","schema_version":"1.0","event_id":"sha256:12c456e62eb3c5721e10135e29ea8005c9c8064380de33d98d5d81ad92119a5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LMUKAVVYT44N7VVTL3K44OMEIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning data augmentation policies using augmented random search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Bo Ding, Huaimin Wang, Kele Xu, Lei Zhang, Mingyang Geng","submitted_at":"2018-11-12T15:14:18Z","abstract_excerpt":"Previous attempts for data augmentation are designed manually, and the augmentation policies are dataset-specific. Recently, an automatic data augmentation approach, named AutoAugment, is proposed using reinforcement learning. AutoAugment searches for the augmentation polices in the discrete search space, which may lead to a sub-optimal solution. In this paper, we employ the Augmented Random Search method (ARS) to improve the performance of AutoAugment. Our key contribution is to change the discrete search space to continuous space, which will improve the searching performance and maintain the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04768","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-18T00:01:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I39HySKATKNs8B0nXfbv3REjJ9cSH4irt8SVQM6/EPtuj4C9NpyYGH8qg3D4OE6Nl69sHVrpSQjWcdk6vCnCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:22:40.587081Z"},"content_sha256":"14b590c7aaff2ebddf9dd1b6cc521ec2e6ac320e993a3f1428fb8fd02fc2e065","schema_version":"1.0","event_id":"sha256:14b590c7aaff2ebddf9dd1b6cc521ec2e6ac320e993a3f1428fb8fd02fc2e065"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMUKAVVYT44N7VVTL3K44OMEIL/bundle.json","state_url":"https://pith.science/pith/LMUKAVVYT44N7VVTL3K44OMEIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMUKAVVYT44N7VVTL3K44OMEIL/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-28T10:22:40Z","links":{"resolver":"https://pith.science/pith/LMUKAVVYT44N7VVTL3K44OMEIL","bundle":"https://pith.science/pith/LMUKAVVYT44N7VVTL3K44OMEIL/bundle.json","state":"https://pith.science/pith/LMUKAVVYT44N7VVTL3K44OMEIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMUKAVVYT44N7VVTL3K44OMEIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LMUKAVVYT44N7VVTL3K44OMEIL","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":"fd7eb0eae17b7227234b13db291cd76fd00747440c21c75a1561ce835cd46aec","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-12T15:14:18Z","title_canon_sha256":"fa6f529315b31e9b1fb6291a281bc4a3690e60b46abb608b71556c5f694906e2"},"schema_version":"1.0","source":{"id":"1811.04768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04768","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04768v1","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04768","created_at":"2026-05-18T00:01:04Z"},{"alias_kind":"pith_short_12","alias_value":"LMUKAVVYT44N","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LMUKAVVYT44N7VVT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LMUKAVVY","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:14b590c7aaff2ebddf9dd1b6cc521ec2e6ac320e993a3f1428fb8fd02fc2e065","target":"graph","created_at":"2026-05-18T00:01:04Z","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":"Previous attempts for data augmentation are designed manually, and the augmentation policies are dataset-specific. Recently, an automatic data augmentation approach, named AutoAugment, is proposed using reinforcement learning. AutoAugment searches for the augmentation polices in the discrete search space, which may lead to a sub-optimal solution. In this paper, we employ the Augmented Random Search method (ARS) to improve the performance of AutoAugment. Our key contribution is to change the discrete search space to continuous space, which will improve the searching performance and maintain the","authors_text":"Bo Ding, Huaimin Wang, Kele Xu, Lei Zhang, Mingyang Geng","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-12T15:14:18Z","title":"Learning data augmentation policies using augmented random search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04768","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:12c456e62eb3c5721e10135e29ea8005c9c8064380de33d98d5d81ad92119a5e","target":"record","created_at":"2026-05-18T00:01:04Z","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":"fd7eb0eae17b7227234b13db291cd76fd00747440c21c75a1561ce835cd46aec","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-12T15:14:18Z","title_canon_sha256":"fa6f529315b31e9b1fb6291a281bc4a3690e60b46abb608b71556c5f694906e2"},"schema_version":"1.0","source":{"id":"1811.04768","kind":"arxiv","version":1}},"canonical_sha256":"5b28a056b89f38dfd6b35ed5ce398442dd00c594a7d7c8fa7e9ff47209bcca1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b28a056b89f38dfd6b35ed5ce398442dd00c594a7d7c8fa7e9ff47209bcca1c","first_computed_at":"2026-05-18T00:01:04.101691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:04.101691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J4+ukugoYtACXXmkGakK0UpNvcwBqWEWlBn7/QAhJDmb2k5E2oeifqpbCvoyF2uJZWq3rETjRoiIGSqFiMTcDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:04.102236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12c456e62eb3c5721e10135e29ea8005c9c8064380de33d98d5d81ad92119a5e","sha256:14b590c7aaff2ebddf9dd1b6cc521ec2e6ac320e993a3f1428fb8fd02fc2e065"],"state_sha256":"e614d25891bddcf60227365b40d2333dcb0d3a9c35da2c0544173972a79c7571"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qm/NnMPJGykA9wNGe4PCUbGPh4vFtaWk4101DYiTt3P2I9+H8SGxJYX0OQ6YHd4I8BEP6Uejwy844nEociGuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:22:40.589263Z","bundle_sha256":"163793bbd6f4af1328c753df65ea97696fbd9e30fa97d7ed5eca165ad83bc046"}}