{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZJ4RP26A377N3O7LLSY5K3P4JS","short_pith_number":"pith:ZJ4RP26A","canonical_record":{"source":{"id":"2605.20184","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T17:59:50Z","cross_cats_sorted":[],"title_canon_sha256":"2e998b2fb6ba046de25a47c909e58d6d579ff34fdfbbc476bb3180779902bb25","abstract_canon_sha256":"b313569fbafd98b8552af6a7949e2b5d0368ef5cea34f88d2b0e5b0fb3c41c20"},"schema_version":"1.0"},"canonical_sha256":"ca7917ebc0dffeddbbeb5cb1d56dfc4cafd823f3e1e8f34124114d8ddd26d593","source":{"kind":"arxiv","id":"2605.20184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20184","created_at":"2026-05-20T02:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20184v1","created_at":"2026-05-20T02:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20184","created_at":"2026-05-20T02:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZJ4RP26A377N","created_at":"2026-05-20T02:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"ZJ4RP26A377N3O7L","created_at":"2026-05-20T02:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"ZJ4RP26A","created_at":"2026-05-20T02:06:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZJ4RP26A377N3O7LLSY5K3P4JS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.20184","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T17:59:50Z","cross_cats_sorted":[],"title_canon_sha256":"2e998b2fb6ba046de25a47c909e58d6d579ff34fdfbbc476bb3180779902bb25","abstract_canon_sha256":"b313569fbafd98b8552af6a7949e2b5d0368ef5cea34f88d2b0e5b0fb3c41c20"},"schema_version":"1.0"},"canonical_sha256":"ca7917ebc0dffeddbbeb5cb1d56dfc4cafd823f3e1e8f34124114d8ddd26d593","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:06:06.901713Z","signature_b64":"YNSvrqchggXH1JBEMish7CSimXPY8gXMWuXJ/BICIYsk24tWbORFZbHWl+jgP7lXhdmLzz9zVvdMfrdnEjvaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca7917ebc0dffeddbbeb5cb1d56dfc4cafd823f3e1e8f34124114d8ddd26d593","last_reissued_at":"2026-05-20T02:06:06.900834Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:06:06.900834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.20184","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-20T02:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6szaKBRlKrCDapumiv8lbGp6Q8ro4QjSVtd09iserRH+ceMhV3fopdz5m1/jQGE71Kc8NS6SfOUXfkGfGB6wDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:12.621108Z"},"content_sha256":"ed70e3cad14946b6990211524df9683a14aa573dfe876c89eedc789be9440ae9","schema_version":"1.0","event_id":"sha256:ed70e3cad14946b6990211524df9683a14aa573dfe876c89eedc789be9440ae9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZJ4RP26A377N3O7LLSY5K3P4JS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hypercube geodesics with few colour changes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lawrence Hollom","submitted_at":"2026-05-19T17:59:50Z","abstract_excerpt":"What is the maximum, over all 2-colourings of the edges of the $n$-dimensional hypercube $Q_n$, of the minimal number of times a path between a vertex $v$ and its antipode $\\bar{v}$ changes colour? A conjecture of Norine, in a form due to Feder and Subi, states that this maximum should be 1. The previous best-known upper bound on the number of colour changes was $(\\tfrac{3}{8} + o(1))n$ due to Dvo\\v{r}\\'{a}k. We improve this bound and answer a question of Leader and Long by finding a geodesic path with at most $(\\tfrac{\\pi}{2} + o(1))\\sqrt{n}$ colour changes. In fact, we show that this is the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20184","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/2605.20184/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-05-20T02:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAN/OPn3tsKrcfRIjjVNvIvu8SQWcky8rFLFbBzZVaQuo4cxruKdvmne8+X4Hhy7LNJJbk4xgk2DKqdCyL9uAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:12.621930Z"},"content_sha256":"37ad99c23dc82c4cceb035a223564c4356384553c5c0d490f0e7d026a5560134","schema_version":"1.0","event_id":"sha256:37ad99c23dc82c4cceb035a223564c4356384553c5c0d490f0e7d026a5560134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/bundle.json","state_url":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/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-05-25T18:59:12Z","links":{"resolver":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS","bundle":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/bundle.json","state":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZJ4RP26A377N3O7LLSY5K3P4JS","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":"b313569fbafd98b8552af6a7949e2b5d0368ef5cea34f88d2b0e5b0fb3c41c20","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T17:59:50Z","title_canon_sha256":"2e998b2fb6ba046de25a47c909e58d6d579ff34fdfbbc476bb3180779902bb25"},"schema_version":"1.0","source":{"id":"2605.20184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20184","created_at":"2026-05-20T02:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20184v1","created_at":"2026-05-20T02:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20184","created_at":"2026-05-20T02:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"ZJ4RP26A377N","created_at":"2026-05-20T02:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"ZJ4RP26A377N3O7L","created_at":"2026-05-20T02:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"ZJ4RP26A","created_at":"2026-05-20T02:06:06Z"}],"graph_snapshots":[{"event_id":"sha256:37ad99c23dc82c4cceb035a223564c4356384553c5c0d490f0e7d026a5560134","target":"graph","created_at":"2026-05-20T02:06:06Z","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/2605.20184/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"What is the maximum, over all 2-colourings of the edges of the $n$-dimensional hypercube $Q_n$, of the minimal number of times a path between a vertex $v$ and its antipode $\\bar{v}$ changes colour? A conjecture of Norine, in a form due to Feder and Subi, states that this maximum should be 1. The previous best-known upper bound on the number of colour changes was $(\\tfrac{3}{8} + o(1))n$ due to Dvo\\v{r}\\'{a}k. We improve this bound and answer a question of Leader and Long by finding a geodesic path with at most $(\\tfrac{\\pi}{2} + o(1))\\sqrt{n}$ colour changes. In fact, we show that this is the ","authors_text":"Lawrence Hollom","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T17:59:50Z","title":"Hypercube geodesics with few colour changes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20184","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:ed70e3cad14946b6990211524df9683a14aa573dfe876c89eedc789be9440ae9","target":"record","created_at":"2026-05-20T02:06:06Z","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":"b313569fbafd98b8552af6a7949e2b5d0368ef5cea34f88d2b0e5b0fb3c41c20","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T17:59:50Z","title_canon_sha256":"2e998b2fb6ba046de25a47c909e58d6d579ff34fdfbbc476bb3180779902bb25"},"schema_version":"1.0","source":{"id":"2605.20184","kind":"arxiv","version":1}},"canonical_sha256":"ca7917ebc0dffeddbbeb5cb1d56dfc4cafd823f3e1e8f34124114d8ddd26d593","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca7917ebc0dffeddbbeb5cb1d56dfc4cafd823f3e1e8f34124114d8ddd26d593","first_computed_at":"2026-05-20T02:06:06.900834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T02:06:06.900834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YNSvrqchggXH1JBEMish7CSimXPY8gXMWuXJ/BICIYsk24tWbORFZbHWl+jgP7lXhdmLzz9zVvdMfrdnEjvaBA==","signature_status":"signed_v1","signed_at":"2026-05-20T02:06:06.901713Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed70e3cad14946b6990211524df9683a14aa573dfe876c89eedc789be9440ae9","sha256:37ad99c23dc82c4cceb035a223564c4356384553c5c0d490f0e7d026a5560134"],"state_sha256":"dc6923489b8622c96a11ef0ccfb9d0c45402d9fd94f6d6b56f97ee4f8592254c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyBBSznkmfSPHGK+CHi/KMCXyOUWtWZp08J8uHsJjXIb46UZ3H4/RUGW8uE4rIZ+MZinMgNGuJFCMVpMmz0cDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:59:12.625877Z","bundle_sha256":"c6e3a6d6d4d300f13939b5c424b0a1092535a501a4dfa5f9321d88400683432f"}}