{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3YLKYTUWKBOHSOCPGZZRUH7EGD","short_pith_number":"pith:3YLKYTUW","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"},"canonical_sha256":"de16ac4e96505c79384f36731a1fe430caea89c401d7a41259b2425ff9a90f8c","source":{"kind":"arxiv","id":"1402.2148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2148","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2148v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2148","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"3YLKYTUWKBOH","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3YLKYTUWKBOHSOCP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3YLKYTUW","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3YLKYTUWKBOHSOCPGZZRUH7EGD","target":"record","payload":{"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"},"canonical_sha256":"de16ac4e96505c79384f36731a1fe430caea89c401d7a41259b2425ff9a90f8c","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"},"source_kind":"arxiv","source_id":"1402.2148","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-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sH4off2HnZV5YD+54IHtmi13Zd/2bTlkOWKqBOaCD4wBsgiMVCQdh7XNvr8Qr+gtcrbIYxF+7SZ02s/nvFs9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:28:31.509911Z"},"content_sha256":"33951da097f4e3b4d8d8b8d2a8ca3f9373e044cf854be612fab42b2b1488a143","schema_version":"1.0","event_id":"sha256:33951da097f4e3b4d8d8b8d2a8ca3f9373e044cf854be612fab42b2b1488a143"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3YLKYTUWKBOHSOCPGZZRUH7EGD","target":"graph","payload":{"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"},"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-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SoWgcX8haecv1ezm7edYiwQSTqo44A/0oDJkv6dcZ1Hzk9o+Y+zMpnfU+7QOGHEjsns5FhidJOk/EU6VFPQoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:28:31.510246Z"},"content_sha256":"b4f14a1ec3d0d8a151f1134a84235b2f636d0ccc9c944dfea8325affb90a40ec","schema_version":"1.0","event_id":"sha256:b4f14a1ec3d0d8a151f1134a84235b2f636d0ccc9c944dfea8325affb90a40ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/bundle.json","state_url":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/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-06-26T21:28:31Z","links":{"resolver":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD","bundle":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/bundle.json","state":"https://pith.science/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YLKYTUWKBOHSOCPGZZRUH7EGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3YLKYTUWKBOHSOCPGZZRUH7EGD","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":"40608045b10c2ed246fa87031da84b4493e00079a06e2910f1bf3fe0c0b5706e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-10T13:57:32Z","title_canon_sha256":"a64c794acaa2bf4d9f9e0c19477f1a1065554476f2d9c58bde62af51af60c91e"},"schema_version":"1.0","source":{"id":"1402.2148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2148","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2148v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2148","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"3YLKYTUWKBOH","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3YLKYTUWKBOHSOCP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3YLKYTUW","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:b4f14a1ec3d0d8a151f1134a84235b2f636d0ccc9c944dfea8325affb90a40ec","target":"graph","created_at":"2026-05-18T02:59:32Z","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":"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","authors_text":"Ichiro Takeuchi, Kohei Ogawa, Yoshiki Suzuki, Yuki Shinmura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-10T13:57:32Z","title":"An Algorithmic Framework for Computing Validation Performance Bounds by Using Suboptimal Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2148","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:33951da097f4e3b4d8d8b8d2a8ca3f9373e044cf854be612fab42b2b1488a143","target":"record","created_at":"2026-05-18T02:59:32Z","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":"40608045b10c2ed246fa87031da84b4493e00079a06e2910f1bf3fe0c0b5706e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-10T13:57:32Z","title_canon_sha256":"a64c794acaa2bf4d9f9e0c19477f1a1065554476f2d9c58bde62af51af60c91e"},"schema_version":"1.0","source":{"id":"1402.2148","kind":"arxiv","version":1}},"canonical_sha256":"de16ac4e96505c79384f36731a1fe430caea89c401d7a41259b2425ff9a90f8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de16ac4e96505c79384f36731a1fe430caea89c401d7a41259b2425ff9a90f8c","first_computed_at":"2026-05-18T02:59:32.183072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:32.183072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N7l4hqdHK5Dt6m0nr4TiZRP8hYQakAyTC4SEa6hqJsI660e6o73gfD1WsUy+watASZaSiuo95M+2jOZhQyBXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:32.183867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33951da097f4e3b4d8d8b8d2a8ca3f9373e044cf854be612fab42b2b1488a143","sha256:b4f14a1ec3d0d8a151f1134a84235b2f636d0ccc9c944dfea8325affb90a40ec"],"state_sha256":"1df319741602762cd0cc386f3326cf63e6019f35f62b7b871e589e8cae83ed94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XswlhZ4TOFh0uRU9Wneqhp/PlVN7FUWYoEuGJC9/vAS/c9L+C0NZ+e3PBYgxZGYj9S6npQGyV270m5+/NEKPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T21:28:31.512098Z","bundle_sha256":"4659ba0c09d614bbb93680f5d2a42b2be6972ee7c03fd7add914a58e7a10defd"}}