{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YI5DSXGKKDV5AY3J4RQ6HIRBUY","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":"960af7b6487e1df48ee347a4c7b3113a54847682387c7b57401bdbf890a9fccb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-06T18:18:52Z","title_canon_sha256":"7d1651a95c725c6c7410f3f42d7e1fd9a72119b380efc0f4328d37ef87f5f90b"},"schema_version":"1.0","source":{"id":"2505.03903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.03903","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"2505.03903v1","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03903","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"YI5DSXGKKDV5","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"pith_short_16","alias_value":"YI5DSXGKKDV5AY3J","created_at":"2026-07-05T10:59:33Z"},{"alias_kind":"pith_short_8","alias_value":"YI5DSXGK","created_at":"2026-07-05T10:59:33Z"}],"graph_snapshots":[{"event_id":"sha256:dd34ebaa4c239961f4ef5c0b83cb99ca453ba07ba366e743d6c840d3539654f3","target":"graph","created_at":"2026-07-05T10:59:33Z","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/2505.03903/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that if $G$ is an $n$-vertex graph whose edges are coloured with red and blue, then the number of colour-alternating walks of length $2k+1$ with $k+1$ red edges and $k$ blue edges is at most $k^k(k+1)^{k+1}(2k+1)^{-2k-1}n^{2k+2}$. This solves a problem that was recently posed by Basit, Granet, Horsley, K\\\"undgen and Staden. Our proof involves an application of the entropy method.","authors_text":"Felix Christian Clemen, Hao Chen, Jonathan A. Noel","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03903","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:87e8435ce38203c40812a0241715a20701cc11644f2ad1725fee2c6363b0aeb8","target":"record","created_at":"2026-07-05T10:59:33Z","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":"960af7b6487e1df48ee347a4c7b3113a54847682387c7b57401bdbf890a9fccb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-06T18:18:52Z","title_canon_sha256":"7d1651a95c725c6c7410f3f42d7e1fd9a72119b380efc0f4328d37ef87f5f90b"},"schema_version":"1.0","source":{"id":"2505.03903","kind":"arxiv","version":1}},"canonical_sha256":"c23a395cca50ebd06369e461e3a221a624c708502de862a7b07ba6cb9d5f7c94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c23a395cca50ebd06369e461e3a221a624c708502de862a7b07ba6cb9d5f7c94","first_computed_at":"2026-07-05T10:59:33.550944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:59:33.550944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c8476Eziuj2yWQuW8204qyEGcMq37t4wK4h2mGx2s46O3yYndljSIBMnzxquqYR0kvx9snND0VflkypJKBH2Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:59:33.551451Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.03903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87e8435ce38203c40812a0241715a20701cc11644f2ad1725fee2c6363b0aeb8","sha256:dd34ebaa4c239961f4ef5c0b83cb99ca453ba07ba366e743d6c840d3539654f3"],"state_sha256":"63d0194dbc6c68a25ad1db7afb7304809e3d74f2a056fac260a1c456b2874184"}