{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BSXK3PHUTCAYHZHPGHCT5T7ZJM","short_pith_number":"pith:BSXK3PHU","canonical_record":{"source":{"id":"1908.00704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-02T05:28:03Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"33c0d844d11b3a133386cc4e8dd184bc310e24b36ab536715620208bdadba833","abstract_canon_sha256":"1eaef8c6a9627b4925174cab547542b324eca68aa7689c14a41c0f1e029dd83d"},"schema_version":"1.0"},"canonical_sha256":"0caeadbcf4988183e4ef31c53ecff94b11e0f12537218ce56ffd2c96d5d4fcc4","source":{"kind":"arxiv","id":"1908.00704","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00704","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00704v2","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00704","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"BSXK3PHUTCAY","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_16","alias_value":"BSXK3PHUTCAYHZHP","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_8","alias_value":"BSXK3PHU","created_at":"2026-07-05T01:40:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BSXK3PHUTCAYHZHPGHCT5T7ZJM","target":"record","payload":{"canonical_record":{"source":{"id":"1908.00704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-02T05:28:03Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"33c0d844d11b3a133386cc4e8dd184bc310e24b36ab536715620208bdadba833","abstract_canon_sha256":"1eaef8c6a9627b4925174cab547542b324eca68aa7689c14a41c0f1e029dd83d"},"schema_version":"1.0"},"canonical_sha256":"0caeadbcf4988183e4ef31c53ecff94b11e0f12537218ce56ffd2c96d5d4fcc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:55.458807Z","signature_b64":"EOa4Jl7RWsEKsbuW1aTfQVuV+lvWWl51Zqf6oKG240qhfYzW8aOdQ+3zwizWikaydCje409vx67pu9YZp2oJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0caeadbcf4988183e4ef31c53ecff94b11e0f12537218ce56ffd2c96d5d4fcc4","last_reissued_at":"2026-07-05T01:40:55.458381Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:55.458381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.00704","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-07-05T01:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZRIk0yCDfXMO++JGx7j5gYtJG+4xX7N7zW5tDMkSZ+MkePE+d7WPn2sncbz/mQm3SPXDjLuBGVAgDr/MGUwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:24:34.204805Z"},"content_sha256":"f187410c4152ef6090f3ec77c492c25839ebcd8e89879ff69512a0c6bb34939f","schema_version":"1.0","event_id":"sha256:f187410c4152ef6090f3ec77c492c25839ebcd8e89879ff69512a0c6bb34939f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BSXK3PHUTCAYHZHPGHCT5T7ZJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy AutoAugment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alireza Naghizadeh, Dimitris N. Metaxas, Mohammadsajad Abavisani","submitted_at":"2019-08-02T05:28:03Z","abstract_excerpt":"A major problem in data augmentation is to ensure that the generated new samples cover the search space. This is a challenging problem and requires exploration for data augmentation policies to ensure their effectiveness in covering the search space. In this paper, we propose Greedy AutoAugment as a highly efficient search algorithm to find the best augmentation policies. We use a greedy approach to reduce the exponential growth of the number of possible trials to linear growth. The Greedy Search also helps us to lead the search towards the sub-policies with better results, which eventually he"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00704","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.00704/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRHThGFSZMvi2qFg+a9M05U+rCqOcnILDdUCHr/o1ebnmmKqhkopyOMVIltPmX/tKuRy6+Ol98QJxwRXjPmTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:24:34.205374Z"},"content_sha256":"58f5e58e37affe63284060ee7351a03c9991301bf717669399839a2e46869aa7","schema_version":"1.0","event_id":"sha256:58f5e58e37affe63284060ee7351a03c9991301bf717669399839a2e46869aa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/bundle.json","state_url":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/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-08-16T05:24:34Z","links":{"resolver":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM","bundle":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/bundle.json","state":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BSXK3PHUTCAYHZHPGHCT5T7ZJM","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":"1eaef8c6a9627b4925174cab547542b324eca68aa7689c14a41c0f1e029dd83d","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-02T05:28:03Z","title_canon_sha256":"33c0d844d11b3a133386cc4e8dd184bc310e24b36ab536715620208bdadba833"},"schema_version":"1.0","source":{"id":"1908.00704","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00704","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00704v2","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00704","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"BSXK3PHUTCAY","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_16","alias_value":"BSXK3PHUTCAYHZHP","created_at":"2026-07-05T01:40:55Z"},{"alias_kind":"pith_short_8","alias_value":"BSXK3PHU","created_at":"2026-07-05T01:40:55Z"}],"graph_snapshots":[{"event_id":"sha256:58f5e58e37affe63284060ee7351a03c9991301bf717669399839a2e46869aa7","target":"graph","created_at":"2026-07-05T01:40:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.00704/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A major problem in data augmentation is to ensure that the generated new samples cover the search space. This is a challenging problem and requires exploration for data augmentation policies to ensure their effectiveness in covering the search space. In this paper, we propose Greedy AutoAugment as a highly efficient search algorithm to find the best augmentation policies. We use a greedy approach to reduce the exponential growth of the number of possible trials to linear growth. The Greedy Search also helps us to lead the search towards the sub-policies with better results, which eventually he","authors_text":"Alireza Naghizadeh, Dimitris N. Metaxas, Mohammadsajad Abavisani","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-02T05:28:03Z","title":"Greedy AutoAugment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00704","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:f187410c4152ef6090f3ec77c492c25839ebcd8e89879ff69512a0c6bb34939f","target":"record","created_at":"2026-07-05T01:40:55Z","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":"1eaef8c6a9627b4925174cab547542b324eca68aa7689c14a41c0f1e029dd83d","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-02T05:28:03Z","title_canon_sha256":"33c0d844d11b3a133386cc4e8dd184bc310e24b36ab536715620208bdadba833"},"schema_version":"1.0","source":{"id":"1908.00704","kind":"arxiv","version":2}},"canonical_sha256":"0caeadbcf4988183e4ef31c53ecff94b11e0f12537218ce56ffd2c96d5d4fcc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0caeadbcf4988183e4ef31c53ecff94b11e0f12537218ce56ffd2c96d5d4fcc4","first_computed_at":"2026-07-05T01:40:55.458381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:40:55.458381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EOa4Jl7RWsEKsbuW1aTfQVuV+lvWWl51Zqf6oKG240qhfYzW8aOdQ+3zwizWikaydCje409vx67pu9YZp2oJDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:40:55.458807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00704","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f187410c4152ef6090f3ec77c492c25839ebcd8e89879ff69512a0c6bb34939f","sha256:58f5e58e37affe63284060ee7351a03c9991301bf717669399839a2e46869aa7"],"state_sha256":"7828b4122aaebca5e4081d58ccbd18818600ff6629b97bc01b2a2e1fd38a09fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKxBoJhT9Vpw0KuKYjUG/j/OtSnkiWK8S+j0Ymu3Mx9iQJUf/QQAMQKoeSE0bY3zo++NO/pPAdiUJeBb3gUNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:24:34.208497Z","bundle_sha256":"6844f27e749db7626d2470911c038a847738c415c24071c2e0f6e5c704883b27"}}