{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KMAQJT7GVOHNHAQEKXUI4FFN3R","short_pith_number":"pith:KMAQJT7G","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"},"canonical_sha256":"530104cfe6ab8ed3820455e88e14addc712c5a81d8e9d88ab8faf6a560394652","source":{"kind":"arxiv","id":"1803.09588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09588","created_at":"2026-05-18T00:20:11Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09588v1","created_at":"2026-05-18T00:20:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09588","created_at":"2026-05-18T00:20:11Z"},{"alias_kind":"pith_short_12","alias_value":"KMAQJT7GVOHN","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KMAQJT7GVOHNHAQE","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KMAQJT7G","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KMAQJT7GVOHNHAQEKXUI4FFN3R","target":"record","payload":{"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"},"canonical_sha256":"530104cfe6ab8ed3820455e88e14addc712c5a81d8e9d88ab8faf6a560394652","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"},"source_kind":"arxiv","source_id":"1803.09588","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:20:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yACShumykhXWZdyQyGtyisAHzkjg49GlRt6WZveu+jKtyOxTZI12GJlH2yKTWP/Ns5nky+Uaswc30LUp20ZoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:52:59.039676Z"},"content_sha256":"6f873aa7d21639337c02d19899c4e93fce7383c141fe8cdb77979f110931716b","schema_version":"1.0","event_id":"sha256:6f873aa7d21639337c02d19899c4e93fce7383c141fe8cdb77979f110931716b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KMAQJT7GVOHNHAQEKXUI4FFN3R","target":"graph","payload":{"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"},"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:20:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZwumFzaGehEU00QciI/GrkP4dpaeRdQDmB4j6//eg98aK4QNU2nWZbRzUMO3QnSEXFGnzTYehZ4XX5KQZYSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:52:59.040145Z"},"content_sha256":"1edbf3a296a10346e8a1bf2b26c61370f0f47619692c806a1edcd7de52e92399","schema_version":"1.0","event_id":"sha256:1edbf3a296a10346e8a1bf2b26c61370f0f47619692c806a1edcd7de52e92399"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/bundle.json","state_url":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/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-26T05:52:59Z","links":{"resolver":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R","bundle":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/bundle.json","state":"https://pith.science/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMAQJT7GVOHNHAQEKXUI4FFN3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KMAQJT7GVOHNHAQEKXUI4FFN3R","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":"0d005723ee6752d823e2328af53a30d4f5f6865081bffd63d6f6cd59b68a9d60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-26T13:46:54Z","title_canon_sha256":"f6c3032c87b997e358e29260721a913cf6700bdd9b6cb1abe25addb29b8fd9a2"},"schema_version":"1.0","source":{"id":"1803.09588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09588","created_at":"2026-05-18T00:20:11Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09588v1","created_at":"2026-05-18T00:20:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09588","created_at":"2026-05-18T00:20:11Z"},{"alias_kind":"pith_short_12","alias_value":"KMAQJT7GVOHN","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KMAQJT7GVOHNHAQE","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KMAQJT7G","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:1edbf3a296a10346e8a1bf2b26c61370f0f47619692c806a1edcd7de52e92399","target":"graph","created_at":"2026-05-18T00:20:11Z","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":"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","authors_text":"Costas Bekas, Cristiano Malossi, Florian Scheidegger, Giovanni Mariani, Luca Benini, Roxana Istrate","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-26T13:46:54Z","title":"Efficient Image Dataset Classification Difficulty Estimation for Predicting Deep-Learning Accuracy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09588","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:6f873aa7d21639337c02d19899c4e93fce7383c141fe8cdb77979f110931716b","target":"record","created_at":"2026-05-18T00:20:11Z","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":"0d005723ee6752d823e2328af53a30d4f5f6865081bffd63d6f6cd59b68a9d60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-26T13:46:54Z","title_canon_sha256":"f6c3032c87b997e358e29260721a913cf6700bdd9b6cb1abe25addb29b8fd9a2"},"schema_version":"1.0","source":{"id":"1803.09588","kind":"arxiv","version":1}},"canonical_sha256":"530104cfe6ab8ed3820455e88e14addc712c5a81d8e9d88ab8faf6a560394652","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"530104cfe6ab8ed3820455e88e14addc712c5a81d8e9d88ab8faf6a560394652","first_computed_at":"2026-05-18T00:20:11.004961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:11.004961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zRDA3FL9GD53LwYJJ9ZoI9F4Dksd036QIlGwcmmaLzQhizTGGUsabqqEpcUzsiXM5s/kOHoMw0NdtbppwbUFDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:11.005740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f873aa7d21639337c02d19899c4e93fce7383c141fe8cdb77979f110931716b","sha256:1edbf3a296a10346e8a1bf2b26c61370f0f47619692c806a1edcd7de52e92399"],"state_sha256":"425690d41bb6181627a50215d473db13cfbeea57cfba8949e707a53c1aa47eb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PXP4wppWVSHkECss7GAjsyiOSoDvAPoLo5NtSJ/wK0mUZOsEW3U3oII1b8NZtpoVqkeJfgTdBA5nyZcJZcDJBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:52:59.044222Z","bundle_sha256":"f93e13c42673933d9308d1f09d9755fbf26dc06c08437f7f3bd4ff51010edb00"}}