{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:O6DYJWLMEGYZJVWEXEMZXOPKPH","short_pith_number":"pith:O6DYJWLM","canonical_record":{"source":{"id":"2607.10379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-07-11T16:12:28Z","cross_cats_sorted":[],"title_canon_sha256":"e4f8ab12ccc5eff71f86a0a6f3d521cdce3a645740c2ba113cd1e504471cd35d","abstract_canon_sha256":"28c3d481c406bc73a239cdd0a7743b2981e58cf21365e65b664323cf15af1359"},"schema_version":"1.0"},"canonical_sha256":"778784d96c21b194d6c4b9199bb9ea79c8ad16e8a14c5c0c988d80fd1400f501","source":{"kind":"arxiv","id":"2607.10379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.10379","created_at":"2026-07-14T01:21:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.10379v1","created_at":"2026-07-14T01:21:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10379","created_at":"2026-07-14T01:21:12Z"},{"alias_kind":"pith_short_12","alias_value":"O6DYJWLMEGYZ","created_at":"2026-07-14T01:21:12Z"},{"alias_kind":"pith_short_16","alias_value":"O6DYJWLMEGYZJVWE","created_at":"2026-07-14T01:21:12Z"},{"alias_kind":"pith_short_8","alias_value":"O6DYJWLM","created_at":"2026-07-14T01:21:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:O6DYJWLMEGYZJVWEXEMZXOPKPH","target":"record","payload":{"canonical_record":{"source":{"id":"2607.10379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-07-11T16:12:28Z","cross_cats_sorted":[],"title_canon_sha256":"e4f8ab12ccc5eff71f86a0a6f3d521cdce3a645740c2ba113cd1e504471cd35d","abstract_canon_sha256":"28c3d481c406bc73a239cdd0a7743b2981e58cf21365e65b664323cf15af1359"},"schema_version":"1.0"},"canonical_sha256":"778784d96c21b194d6c4b9199bb9ea79c8ad16e8a14c5c0c988d80fd1400f501","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:12.868099Z","signature_b64":"KA67jyBTaM3x/kU08J4hstVcVaX+Nr0xU3h+HRLD0DfmU7JGzuZsUmOFnLP4Uq6r5um+aO55mAZICi/wzxgfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"778784d96c21b194d6c4b9199bb9ea79c8ad16e8a14c5c0c988d80fd1400f501","last_reissued_at":"2026-07-14T01:21:12.867347Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:12.867347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.10379","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-07-14T01:21:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gq+pRJMfdmSvNFyNVtdXC+zP3/rQlMWuGrVuQCxuwMRNkFfRGDYdUTpSXqXMKFdKOjH794U7Fri4aMTdJE6EDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T01:41:06.854413Z"},"content_sha256":"f34233d37eb19f00eadf16baee234c66efd5aecb3292b3f18bb22346fd1883be","schema_version":"1.0","event_id":"sha256:f34233d37eb19f00eadf16baee234c66efd5aecb3292b3f18bb22346fd1883be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:O6DYJWLMEGYZJVWEXEMZXOPKPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Automated Confidence Bound Provers and Searchers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Erik Learned-Miller, My Phan","submitted_at":"2026-07-11T16:12:28Z","abstract_excerpt":"In this work we lay the groundwork for automating the process of finding and proving the validity of lower confidence bounds of the mean. Our key finding is based on the observation that finding an optimal confidence bound under certain conditions can be formulated as an optimization problem. We use this observation to show that any valid confidence bound (such as Hoeffding's) must be a relaxation of a certain optimization problem. To automatically find and prove confidence bounds, we need to automate the process of defining and finding such a relaxation. We define a family of relaxations para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10379","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.10379/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-14T01:21:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gcsh8qrSfvjVuXUxEpWRDRFgxpmOMhMcCW7DCLcXAKeJZ1dtsFNiRzJmVVEoj8ZE2ZlYDMPnPGblxXGskd2JBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T01:41:06.855307Z"},"content_sha256":"cfa2388f45c6c5f9d4986bc8115b8b90dbb996c1c4879bd894ec0a185e84500c","schema_version":"1.0","event_id":"sha256:cfa2388f45c6c5f9d4986bc8115b8b90dbb996c1c4879bd894ec0a185e84500c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6DYJWLMEGYZJVWEXEMZXOPKPH/bundle.json","state_url":"https://pith.science/pith/O6DYJWLMEGYZJVWEXEMZXOPKPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6DYJWLMEGYZJVWEXEMZXOPKPH/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-08-03T01:41:06Z","links":{"resolver":"https://pith.science/pith/O6DYJWLMEGYZJVWEXEMZXOPKPH","bundle":"https://pith.science/pith/O6DYJWLMEGYZJVWEXEMZXOPKPH/bundle.json","state":"https://pith.science/pith/O6DYJWLMEGYZJVWEXEMZXOPKPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6DYJWLMEGYZJVWEXEMZXOPKPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:O6DYJWLMEGYZJVWEXEMZXOPKPH","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":"28c3d481c406bc73a239cdd0a7743b2981e58cf21365e65b664323cf15af1359","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-07-11T16:12:28Z","title_canon_sha256":"e4f8ab12ccc5eff71f86a0a6f3d521cdce3a645740c2ba113cd1e504471cd35d"},"schema_version":"1.0","source":{"id":"2607.10379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.10379","created_at":"2026-07-14T01:21:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.10379v1","created_at":"2026-07-14T01:21:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10379","created_at":"2026-07-14T01:21:12Z"},{"alias_kind":"pith_short_12","alias_value":"O6DYJWLMEGYZ","created_at":"2026-07-14T01:21:12Z"},{"alias_kind":"pith_short_16","alias_value":"O6DYJWLMEGYZJVWE","created_at":"2026-07-14T01:21:12Z"},{"alias_kind":"pith_short_8","alias_value":"O6DYJWLM","created_at":"2026-07-14T01:21:12Z"}],"graph_snapshots":[{"event_id":"sha256:cfa2388f45c6c5f9d4986bc8115b8b90dbb996c1c4879bd894ec0a185e84500c","target":"graph","created_at":"2026-07-14T01:21:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.10379/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work we lay the groundwork for automating the process of finding and proving the validity of lower confidence bounds of the mean. Our key finding is based on the observation that finding an optimal confidence bound under certain conditions can be formulated as an optimization problem. We use this observation to show that any valid confidence bound (such as Hoeffding's) must be a relaxation of a certain optimization problem. To automatically find and prove confidence bounds, we need to automate the process of defining and finding such a relaxation. We define a family of relaxations para","authors_text":"Erik Learned-Miller, My Phan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-07-11T16:12:28Z","title":"Towards Automated Confidence Bound Provers and Searchers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10379","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:f34233d37eb19f00eadf16baee234c66efd5aecb3292b3f18bb22346fd1883be","target":"record","created_at":"2026-07-14T01:21:12Z","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":"28c3d481c406bc73a239cdd0a7743b2981e58cf21365e65b664323cf15af1359","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-07-11T16:12:28Z","title_canon_sha256":"e4f8ab12ccc5eff71f86a0a6f3d521cdce3a645740c2ba113cd1e504471cd35d"},"schema_version":"1.0","source":{"id":"2607.10379","kind":"arxiv","version":1}},"canonical_sha256":"778784d96c21b194d6c4b9199bb9ea79c8ad16e8a14c5c0c988d80fd1400f501","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"778784d96c21b194d6c4b9199bb9ea79c8ad16e8a14c5c0c988d80fd1400f501","first_computed_at":"2026-07-14T01:21:12.867347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:21:12.867347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KA67jyBTaM3x/kU08J4hstVcVaX+Nr0xU3h+HRLD0DfmU7JGzuZsUmOFnLP4Uq6r5um+aO55mAZICi/wzxgfBA==","signature_status":"signed_v1","signed_at":"2026-07-14T01:21:12.868099Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.10379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f34233d37eb19f00eadf16baee234c66efd5aecb3292b3f18bb22346fd1883be","sha256:cfa2388f45c6c5f9d4986bc8115b8b90dbb996c1c4879bd894ec0a185e84500c"],"state_sha256":"7fe2df53fd87d5d37e21d4de64c953142a9387c7d5ad14d4700323f78ac56202"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s1GtpjAJo8o2i+SXGiTm9iHO87GvPsnY7opSkqMtrHBuGBaqkPiPMcQw9NQ1+a1X6BvSw0dqRZDarCbsE3FzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T01:41:06.859519Z","bundle_sha256":"d62c2020d3842ece2dd0b6e7dd4565bac7ceb558f990eeca8ca4002bb94abb51"}}