{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G6V32APMPKNQIDRTPDIADZT54N","short_pith_number":"pith:G6V32APM","schema_version":"1.0","canonical_sha256":"37abbd01ec7a9b040e3378d001e67de37cbc71a43131c5cc96cbe37e7d10d1f2","source":{"kind":"arxiv","id":"1903.02521","version":1},"attestation_state":"computed","paper":{"title":"Quantifying error contributions of computational steps, algorithms and hyperparameter choices in image classification pipelines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Aritra Chowdhury, Bulent Yener, Malik Magdin-Ismail","submitted_at":"2019-02-25T19:16:58Z","abstract_excerpt":"Data science relies on pipelines that are organized in the form of interdependent computational steps. Each step consists of various candidate algorithms that maybe used for performing a particular function. Each algorithm consists of several hyperparameters. Algorithms and hyperparameters must be optimized as a whole to produce the best performance. Typical machine learning pipelines typically consist of complex algorithms in each of the steps. Not only is the selection process combinatorial, but it is also important to interpret and understand the pipelines. We propose a method to quantify t"},"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":"1903.02521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-25T19:16:58Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9a66442ef382ce594a79fadee1cabe194f2e801161d642b735b2cc28fb2fa268","abstract_canon_sha256":"d62bf7afabc93a096e3d33ffc495f49c17dd5e1c3380646056e2bf536f7936f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.160409Z","signature_b64":"jcqwDqza+HPtnavwWf2CHwSNq3/jxWwAz/UpDIWU2611zTnSXGi3+OIwdD70QwEg7XJeg/67p30e77Zd+YpWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37abbd01ec7a9b040e3378d001e67de37cbc71a43131c5cc96cbe37e7d10d1f2","last_reissued_at":"2026-05-17T23:51:55.159845Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.159845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantifying error contributions of computational steps, algorithms and hyperparameter choices in image classification pipelines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Aritra Chowdhury, Bulent Yener, Malik Magdin-Ismail","submitted_at":"2019-02-25T19:16:58Z","abstract_excerpt":"Data science relies on pipelines that are organized in the form of interdependent computational steps. Each step consists of various candidate algorithms that maybe used for performing a particular function. Each algorithm consists of several hyperparameters. Algorithms and hyperparameters must be optimized as a whole to produce the best performance. Typical machine learning pipelines typically consist of complex algorithms in each of the steps. Not only is the selection process combinatorial, but it is also important to interpret and understand the pipelines. We propose a method to quantify t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02521","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":"1903.02521","created_at":"2026-05-17T23:51:55.159947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02521v1","created_at":"2026-05-17T23:51:55.159947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02521","created_at":"2026-05-17T23:51:55.159947+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6V32APMPKNQ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6V32APMPKNQIDRT","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6V32APM","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00678","citing_title":"Two-stage Optimization for Machine Learning Workflow","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G6V32APMPKNQIDRTPDIADZT54N","json":"https://pith.science/pith/G6V32APMPKNQIDRTPDIADZT54N.json","graph_json":"https://pith.science/api/pith-number/G6V32APMPKNQIDRTPDIADZT54N/graph.json","events_json":"https://pith.science/api/pith-number/G6V32APMPKNQIDRTPDIADZT54N/events.json","paper":"https://pith.science/paper/G6V32APM"},"agent_actions":{"view_html":"https://pith.science/pith/G6V32APMPKNQIDRTPDIADZT54N","download_json":"https://pith.science/pith/G6V32APMPKNQIDRTPDIADZT54N.json","view_paper":"https://pith.science/paper/G6V32APM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02521&json=true","fetch_graph":"https://pith.science/api/pith-number/G6V32APMPKNQIDRTPDIADZT54N/graph.json","fetch_events":"https://pith.science/api/pith-number/G6V32APMPKNQIDRTPDIADZT54N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6V32APMPKNQIDRTPDIADZT54N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6V32APMPKNQIDRTPDIADZT54N/action/storage_attestation","attest_author":"https://pith.science/pith/G6V32APMPKNQIDRTPDIADZT54N/action/author_attestation","sign_citation":"https://pith.science/pith/G6V32APMPKNQIDRTPDIADZT54N/action/citation_signature","submit_replication":"https://pith.science/pith/G6V32APMPKNQIDRTPDIADZT54N/action/replication_record"}},"created_at":"2026-05-17T23:51:55.159947+00:00","updated_at":"2026-05-17T23:51:55.159947+00:00"}