{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KMAQJT7GVOHNHAQEKXUI4FFN3R","short_pith_number":"pith:KMAQJT7G","schema_version":"1.0","canonical_sha256":"530104cfe6ab8ed3820455e88e14addc712c5a81d8e9d88ab8faf6a560394652","source":{"kind":"arxiv","id":"1803.09588","version":1},"attestation_state":"computed","paper":{"title":"Efficient Image Dataset Classification Difficulty Estimation for Predicting Deep-Learning Accuracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Costas Bekas, Cristiano Malossi, Florian Scheidegger, Giovanni Mariani, Luca Benini, Roxana Istrate","submitted_at":"2018-03-26T13:46:54Z","abstract_excerpt":"In the deep-learning community new algorithms are published at an incredible pace. Therefore, solving an image classification problem for new datasets becomes a challenging task, as it requires to re-evaluate published algorithms and their different configurations in order to find a close to optimal classifier. To facilitate this process, before biasing our decision towards a class of neural networks or running an expensive search over the network space, we propose to estimate the classification difficulty of the dataset. Our method computes a single number that characterizes the dataset diffi"},"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":"1803.09588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-26T13:46:54Z","cross_cats_sorted":[],"title_canon_sha256":"f6c3032c87b997e358e29260721a913cf6700bdd9b6cb1abe25addb29b8fd9a2","abstract_canon_sha256":"0d005723ee6752d823e2328af53a30d4f5f6865081bffd63d6f6cd59b68a9d60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:11.005740Z","signature_b64":"zRDA3FL9GD53LwYJJ9ZoI9F4Dksd036QIlGwcmmaLzQhizTGGUsabqqEpcUzsiXM5s/kOHoMw0NdtbppwbUFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"530104cfe6ab8ed3820455e88e14addc712c5a81d8e9d88ab8faf6a560394652","last_reissued_at":"2026-05-18T00:20:11.004961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:11.004961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Image Dataset Classification Difficulty Estimation for Predicting Deep-Learning Accuracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Costas Bekas, Cristiano Malossi, Florian Scheidegger, Giovanni Mariani, Luca Benini, Roxana Istrate","submitted_at":"2018-03-26T13:46:54Z","abstract_excerpt":"In the deep-learning community new algorithms are published at an incredible pace. Therefore, solving an image classification problem for new datasets becomes a challenging task, as it requires to re-evaluate published algorithms and their different configurations in order to find a close to optimal classifier. To facilitate this process, before biasing our decision towards a class of neural networks or running an expensive search over the network space, we propose to estimate the classification difficulty of the dataset. Our method computes a single number that characterizes the dataset diffi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09588","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.09588","created_at":"2026-05-18T00:20:11.005098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09588v1","created_at":"2026-05-18T00:20:11.005098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09588","created_at":"2026-05-18T00:20:11.005098+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMAQJT7GVOHN","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMAQJT7GVOHNHAQE","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMAQJT7G","created_at":"2026-05-18T12:32:33.847187+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/KMAQJT7GVOHNHAQEKXUI4FFN3R","json":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R.json","graph_json":"https://pith.science/api/pith-number/KMAQJT7GVOHNHAQEKXUI4FFN3R/graph.json","events_json":"https://pith.science/api/pith-number/KMAQJT7GVOHNHAQEKXUI4FFN3R/events.json","paper":"https://pith.science/paper/KMAQJT7G"},"agent_actions":{"view_html":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R","download_json":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R.json","view_paper":"https://pith.science/paper/KMAQJT7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09588&json=true","fetch_graph":"https://pith.science/api/pith-number/KMAQJT7GVOHNHAQEKXUI4FFN3R/graph.json","fetch_events":"https://pith.science/api/pith-number/KMAQJT7GVOHNHAQEKXUI4FFN3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/action/storage_attestation","attest_author":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/action/author_attestation","sign_citation":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/action/citation_signature","submit_replication":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/action/replication_record"}},"created_at":"2026-05-18T00:20:11.005098+00:00","updated_at":"2026-05-18T00:20:11.005098+00:00"}