{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BSXK3PHUTCAYHZHPGHCT5T7ZJM","short_pith_number":"pith:BSXK3PHU","schema_version":"1.0","canonical_sha256":"0caeadbcf4988183e4ef31c53ecff94b11e0f12537218ce56ffd2c96d5d4fcc4","source":{"kind":"arxiv","id":"1908.00704","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.00704","created_at":"2026-07-05T01:40:55.458440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.00704v2","created_at":"2026-07-05T01:40:55.458440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00704","created_at":"2026-07-05T01:40:55.458440+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSXK3PHUTCAY","created_at":"2026-07-05T01:40:55.458440+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSXK3PHUTCAYHZHP","created_at":"2026-07-05T01:40:55.458440+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSXK3PHU","created_at":"2026-07-05T01:40:55.458440+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM","json":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM.json","graph_json":"https://pith.science/api/pith-number/BSXK3PHUTCAYHZHPGHCT5T7ZJM/graph.json","events_json":"https://pith.science/api/pith-number/BSXK3PHUTCAYHZHPGHCT5T7ZJM/events.json","paper":"https://pith.science/paper/BSXK3PHU"},"agent_actions":{"view_html":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM","download_json":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM.json","view_paper":"https://pith.science/paper/BSXK3PHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.00704&json=true","fetch_graph":"https://pith.science/api/pith-number/BSXK3PHUTCAYHZHPGHCT5T7ZJM/graph.json","fetch_events":"https://pith.science/api/pith-number/BSXK3PHUTCAYHZHPGHCT5T7ZJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/action/storage_attestation","attest_author":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/action/author_attestation","sign_citation":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/action/citation_signature","submit_replication":"https://pith.science/pith/BSXK3PHUTCAYHZHPGHCT5T7ZJM/action/replication_record"}},"created_at":"2026-07-05T01:40:55.458440+00:00","updated_at":"2026-07-05T01:40:55.458440+00:00"}