{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KYH5E74EB74BKTQNV7VCNO5P6M","short_pith_number":"pith:KYH5E74E","canonical_record":{"source":{"id":"2607.09014","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-10T00:41:09Z","cross_cats_sorted":[],"title_canon_sha256":"6281851aeb8694d0e788889be2e07c8aff415260f14e11c0cc048ddf59bd2424","abstract_canon_sha256":"f9a53a0340f26c3e5deed852d740f69b4a02a014d90f09408685e2ca653cb74e"},"schema_version":"1.0"},"canonical_sha256":"560fd27f840ff8154e0dafea26bbaff3158d69bd984be022cdf6b1adc0c4a0ff","source":{"kind":"arxiv","id":"2607.09014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09014","created_at":"2026-07-13T00:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09014v1","created_at":"2026-07-13T00:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09014","created_at":"2026-07-13T00:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"KYH5E74EB74B","created_at":"2026-07-13T00:17:34Z"},{"alias_kind":"pith_short_16","alias_value":"KYH5E74EB74BKTQN","created_at":"2026-07-13T00:17:34Z"},{"alias_kind":"pith_short_8","alias_value":"KYH5E74E","created_at":"2026-07-13T00:17:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KYH5E74EB74BKTQNV7VCNO5P6M","target":"record","payload":{"canonical_record":{"source":{"id":"2607.09014","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-10T00:41:09Z","cross_cats_sorted":[],"title_canon_sha256":"6281851aeb8694d0e788889be2e07c8aff415260f14e11c0cc048ddf59bd2424","abstract_canon_sha256":"f9a53a0340f26c3e5deed852d740f69b4a02a014d90f09408685e2ca653cb74e"},"schema_version":"1.0"},"canonical_sha256":"560fd27f840ff8154e0dafea26bbaff3158d69bd984be022cdf6b1adc0c4a0ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T00:17:34.367600Z","signature_b64":"+dileqaQEtRrKwZJepTY9njcjedGdlQwmPYzpkOjHq3FdGrUyw2oqJ2DhVBTFS1P/qCYWOdt8EjIfYQfZcCBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"560fd27f840ff8154e0dafea26bbaff3158d69bd984be022cdf6b1adc0c4a0ff","last_reissued_at":"2026-07-13T00:17:34.365861Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T00:17:34.365861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.09014","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-13T00:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdA2WUQBEF0Sxy9K0WBqxp8fztD+ufy8U12Mvt/0DraPig6awbZDs5dfUFFOhC/5ige8qYPp5C9j85cYHxOvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:18:25.206316Z"},"content_sha256":"d45c887e53c681aaedbb56cdff29957678b984e14c53243f11a6f002b9a4015c","schema_version":"1.0","event_id":"sha256:d45c887e53c681aaedbb56cdff29957678b984e14c53243f11a6f002b9a4015c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KYH5E74EB74BKTQNV7VCNO5P6M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New bounds for double covers of the discrete box {0,1,2}^d","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Patrick White","submitted_at":"2026-07-10T00:41:09Z","abstract_excerpt":"A proper sub-box of $A=\\{0,1,2\\}^d$ is a product $S_1\\times\\dots\\times S_d$ with each $\\varnothing\\neq S_i\\subsetneq\\{0,1,2\\}$. A double cover is a finite multiset of proper sub-boxes covering every point of $A$ exactly twice; write $f(d)$ for the minimum size of a double cover. Leader, Milicevic and Tan asked whether $f(d)\\ge 2^d$ for all $d$ (Question 4.1 of the PatternBoost paper of Charton-Ellenberg-Wagner-Williamson), analogous to the Alon-Bohman-Holzman-Kleitman partition bound $2^d$. No better than the trivial volume bound was previously known, for any $d\\ge 2$.\n  We prove the first non"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09014","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.09014/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-13T00:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9J0a0GK9l32DsrAfshFehLhAXyZ+5XG2a2ta7VJ+6YVUrROUFdlnan/cEptL8G7Zcem9MJq7EQZ0IRYfxqA6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T10:18:25.206819Z"},"content_sha256":"db71733c6d4ed88a66bbc2fabfd2de0957795ef5f651dcd2e488d1d934176a08","schema_version":"1.0","event_id":"sha256:db71733c6d4ed88a66bbc2fabfd2de0957795ef5f651dcd2e488d1d934176a08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYH5E74EB74BKTQNV7VCNO5P6M/bundle.json","state_url":"https://pith.science/pith/KYH5E74EB74BKTQNV7VCNO5P6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYH5E74EB74BKTQNV7VCNO5P6M/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-11T10:18:25Z","links":{"resolver":"https://pith.science/pith/KYH5E74EB74BKTQNV7VCNO5P6M","bundle":"https://pith.science/pith/KYH5E74EB74BKTQNV7VCNO5P6M/bundle.json","state":"https://pith.science/pith/KYH5E74EB74BKTQNV7VCNO5P6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYH5E74EB74BKTQNV7VCNO5P6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KYH5E74EB74BKTQNV7VCNO5P6M","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":"f9a53a0340f26c3e5deed852d740f69b4a02a014d90f09408685e2ca653cb74e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-10T00:41:09Z","title_canon_sha256":"6281851aeb8694d0e788889be2e07c8aff415260f14e11c0cc048ddf59bd2424"},"schema_version":"1.0","source":{"id":"2607.09014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.09014","created_at":"2026-07-13T00:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"2607.09014v1","created_at":"2026-07-13T00:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09014","created_at":"2026-07-13T00:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"KYH5E74EB74B","created_at":"2026-07-13T00:17:34Z"},{"alias_kind":"pith_short_16","alias_value":"KYH5E74EB74BKTQN","created_at":"2026-07-13T00:17:34Z"},{"alias_kind":"pith_short_8","alias_value":"KYH5E74E","created_at":"2026-07-13T00:17:34Z"}],"graph_snapshots":[{"event_id":"sha256:db71733c6d4ed88a66bbc2fabfd2de0957795ef5f651dcd2e488d1d934176a08","target":"graph","created_at":"2026-07-13T00:17:34Z","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.09014/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A proper sub-box of $A=\\{0,1,2\\}^d$ is a product $S_1\\times\\dots\\times S_d$ with each $\\varnothing\\neq S_i\\subsetneq\\{0,1,2\\}$. A double cover is a finite multiset of proper sub-boxes covering every point of $A$ exactly twice; write $f(d)$ for the minimum size of a double cover. Leader, Milicevic and Tan asked whether $f(d)\\ge 2^d$ for all $d$ (Question 4.1 of the PatternBoost paper of Charton-Ellenberg-Wagner-Williamson), analogous to the Alon-Bohman-Holzman-Kleitman partition bound $2^d$. No better than the trivial volume bound was previously known, for any $d\\ge 2$.\n  We prove the first non","authors_text":"Patrick White","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-10T00:41:09Z","title":"New bounds for double covers of the discrete box {0,1,2}^d"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09014","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:d45c887e53c681aaedbb56cdff29957678b984e14c53243f11a6f002b9a4015c","target":"record","created_at":"2026-07-13T00:17:34Z","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":"f9a53a0340f26c3e5deed852d740f69b4a02a014d90f09408685e2ca653cb74e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-10T00:41:09Z","title_canon_sha256":"6281851aeb8694d0e788889be2e07c8aff415260f14e11c0cc048ddf59bd2424"},"schema_version":"1.0","source":{"id":"2607.09014","kind":"arxiv","version":1}},"canonical_sha256":"560fd27f840ff8154e0dafea26bbaff3158d69bd984be022cdf6b1adc0c4a0ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"560fd27f840ff8154e0dafea26bbaff3158d69bd984be022cdf6b1adc0c4a0ff","first_computed_at":"2026-07-13T00:17:34.365861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-13T00:17:34.365861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+dileqaQEtRrKwZJepTY9njcjedGdlQwmPYzpkOjHq3FdGrUyw2oqJ2DhVBTFS1P/qCYWOdt8EjIfYQfZcCBAA==","signature_status":"signed_v1","signed_at":"2026-07-13T00:17:34.367600Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.09014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d45c887e53c681aaedbb56cdff29957678b984e14c53243f11a6f002b9a4015c","sha256:db71733c6d4ed88a66bbc2fabfd2de0957795ef5f651dcd2e488d1d934176a08"],"state_sha256":"f63bf0101640c16959f7dbd09e633524d744d9693dcba8e49fae16ec91778ca0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J6F+psv5yrxCL8jk+3vu/Szv0Haf0SFcTj+8Z0iu4iigt2xy7LFVHejiLgLEiyv6fHVVzdn8LVyi6ZGAqsJ3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T10:18:25.211371Z","bundle_sha256":"daf7ea672f6341fd4fddfa7d1db904a9b09ce390ff6141cf0cb5e386962b11c6"}}