{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZJ4RP26A377N3O7LLSY5K3P4JS","short_pith_number":"pith:ZJ4RP26A","schema_version":"1.0","canonical_sha256":"ca7917ebc0dffeddbbeb5cb1d56dfc4cafd823f3e1e8f34124114d8ddd26d593","source":{"kind":"arxiv","id":"2605.20184","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.20184","created_at":"2026-05-20T02:06:06.900960+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20184v1","created_at":"2026-05-20T02:06:06.900960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20184","created_at":"2026-05-20T02:06:06.900960+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJ4RP26A377N","created_at":"2026-05-20T02:06:06.900960+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJ4RP26A377N3O7L","created_at":"2026-05-20T02:06:06.900960+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJ4RP26A","created_at":"2026-05-20T02:06:06.900960+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/ZJ4RP26A377N3O7LLSY5K3P4JS","json":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS.json","graph_json":"https://pith.science/api/pith-number/ZJ4RP26A377N3O7LLSY5K3P4JS/graph.json","events_json":"https://pith.science/api/pith-number/ZJ4RP26A377N3O7LLSY5K3P4JS/events.json","paper":"https://pith.science/paper/ZJ4RP26A"},"agent_actions":{"view_html":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS","download_json":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS.json","view_paper":"https://pith.science/paper/ZJ4RP26A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20184&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJ4RP26A377N3O7LLSY5K3P4JS/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJ4RP26A377N3O7LLSY5K3P4JS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/action/storage_attestation","attest_author":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/action/author_attestation","sign_citation":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/action/citation_signature","submit_replication":"https://pith.science/pith/ZJ4RP26A377N3O7LLSY5K3P4JS/action/replication_record"}},"created_at":"2026-05-20T02:06:06.900960+00:00","updated_at":"2026-05-20T02:06:06.900960+00:00"}