{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3YLKYTUWKBOHSOCPGZZRUH7EGD","short_pith_number":"pith:3YLKYTUW","schema_version":"1.0","canonical_sha256":"de16ac4e96505c79384f36731a1fe430caea89c401d7a41259b2425ff9a90f8c","source":{"kind":"arxiv","id":"1402.2148","version":1},"attestation_state":"computed","paper":{"title":"An Algorithmic Framework for Computing Validation Performance Bounds by Using Suboptimal Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ichiro Takeuchi, Kohei Ogawa, Yoshiki Suzuki, Yuki Shinmura","submitted_at":"2014-02-10T13:57:32Z","abstract_excerpt":"Practical model building processes are often time-consuming because many different models must be trained and validated. In this paper, we introduce a novel algorithm that can be used for computing the lower and the upper bounds of model validation errors without actually training the model itself. A key idea behind our algorithm is using a side information available from a suboptimal model. If a reasonably good suboptimal model is available, our algorithm can compute lower and upper bounds of many useful quantities for making inferences on the unknown target model. We demonstrate the advantag"},"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":"1402.2148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-10T13:57:32Z","cross_cats_sorted":[],"title_canon_sha256":"a64c794acaa2bf4d9f9e0c19477f1a1065554476f2d9c58bde62af51af60c91e","abstract_canon_sha256":"40608045b10c2ed246fa87031da84b4493e00079a06e2910f1bf3fe0c0b5706e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:32.183867Z","signature_b64":"N7l4hqdHK5Dt6m0nr4TiZRP8hYQakAyTC4SEa6hqJsI660e6o73gfD1WsUy+watASZaSiuo95M+2jOZhQyBXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de16ac4e96505c79384f36731a1fe430caea89c401d7a41259b2425ff9a90f8c","last_reissued_at":"2026-05-18T02:59:32.183072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:32.183072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithmic Framework for Computing Validation Performance Bounds by Using Suboptimal Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ichiro Takeuchi, Kohei Ogawa, Yoshiki Suzuki, Yuki Shinmura","submitted_at":"2014-02-10T13:57:32Z","abstract_excerpt":"Practical model building processes are often time-consuming because many different models must be trained and validated. In this paper, we introduce a novel algorithm that can be used for computing the lower and the upper bounds of model validation errors without actually training the model itself. A key idea behind our algorithm is using a side information available from a suboptimal model. If a reasonably good suboptimal model is available, our algorithm can compute lower and upper bounds of many useful quantities for making inferences on the unknown target model. We demonstrate the advantag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2148","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":"1402.2148","created_at":"2026-05-18T02:59:32.183213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2148v1","created_at":"2026-05-18T02:59:32.183213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2148","created_at":"2026-05-18T02:59:32.183213+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YLKYTUWKBOH","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YLKYTUWKBOHSOCP","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YLKYTUW","created_at":"2026-05-18T12:28:11.866339+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/3YLKYTUWKBOHSOCPGZZRUH7EGD","json":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD.json","graph_json":"https://pith.science/api/pith-number/3YLKYTUWKBOHSOCPGZZRUH7EGD/graph.json","events_json":"https://pith.science/api/pith-number/3YLKYTUWKBOHSOCPGZZRUH7EGD/events.json","paper":"https://pith.science/paper/3YLKYTUW"},"agent_actions":{"view_html":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD","download_json":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD.json","view_paper":"https://pith.science/paper/3YLKYTUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2148&json=true","fetch_graph":"https://pith.science/api/pith-number/3YLKYTUWKBOHSOCPGZZRUH7EGD/graph.json","fetch_events":"https://pith.science/api/pith-number/3YLKYTUWKBOHSOCPGZZRUH7EGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/action/storage_attestation","attest_author":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/action/author_attestation","sign_citation":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/action/citation_signature","submit_replication":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/action/replication_record"}},"created_at":"2026-05-18T02:59:32.183213+00:00","updated_at":"2026-05-18T02:59:32.183213+00:00"}