{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YI5DSXGKKDV5AY3J4RQ6HIRBUY","short_pith_number":"pith:YI5DSXGK","schema_version":"1.0","canonical_sha256":"c23a395cca50ebd06369e461e3a221a624c708502de862a7b07ba6cb9d5f7c94","source":{"kind":"arxiv","id":"2505.03903","version":1},"attestation_state":"computed","paper":{"title":"Maximizing Alternating Paths via Entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Christian Clemen, Hao Chen, Jonathan A. Noel","submitted_at":"2025-05-06T18:18:52Z","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."},"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":"2505.03903","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-06T18:18:52Z","cross_cats_sorted":[],"title_canon_sha256":"7d1651a95c725c6c7410f3f42d7e1fd9a72119b380efc0f4328d37ef87f5f90b","abstract_canon_sha256":"960af7b6487e1df48ee347a4c7b3113a54847682387c7b57401bdbf890a9fccb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:33.551451Z","signature_b64":"c8476Eziuj2yWQuW8204qyEGcMq37t4wK4h2mGx2s46O3yYndljSIBMnzxquqYR0kvx9snND0VflkypJKBH2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c23a395cca50ebd06369e461e3a221a624c708502de862a7b07ba6cb9d5f7c94","last_reissued_at":"2026-07-05T10:59:33.550944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:33.550944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Alternating Paths via Entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Christian Clemen, Hao Chen, Jonathan A. Noel","submitted_at":"2025-05-06T18:18:52Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03903","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/2505.03903/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":"2505.03903","created_at":"2026-07-05T10:59:33.551003+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.03903v1","created_at":"2026-07-05T10:59:33.551003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03903","created_at":"2026-07-05T10:59:33.551003+00:00"},{"alias_kind":"pith_short_12","alias_value":"YI5DSXGKKDV5","created_at":"2026-07-05T10:59:33.551003+00:00"},{"alias_kind":"pith_short_16","alias_value":"YI5DSXGKKDV5AY3J","created_at":"2026-07-05T10:59:33.551003+00:00"},{"alias_kind":"pith_short_8","alias_value":"YI5DSXGK","created_at":"2026-07-05T10:59:33.551003+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14138","citing_title":"On Tournament Anti-Sidorenko Orientations of Trees","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YI5DSXGKKDV5AY3J4RQ6HIRBUY","json":"https://pith.science/pith/YI5DSXGKKDV5AY3J4RQ6HIRBUY.json","graph_json":"https://pith.science/api/pith-number/YI5DSXGKKDV5AY3J4RQ6HIRBUY/graph.json","events_json":"https://pith.science/api/pith-number/YI5DSXGKKDV5AY3J4RQ6HIRBUY/events.json","paper":"https://pith.science/paper/YI5DSXGK"},"agent_actions":{"view_html":"https://pith.science/pith/YI5DSXGKKDV5AY3J4RQ6HIRBUY","download_json":"https://pith.science/pith/YI5DSXGKKDV5AY3J4RQ6HIRBUY.json","view_paper":"https://pith.science/paper/YI5DSXGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.03903&json=true","fetch_graph":"https://pith.science/api/pith-number/YI5DSXGKKDV5AY3J4RQ6HIRBUY/graph.json","fetch_events":"https://pith.science/api/pith-number/YI5DSXGKKDV5AY3J4RQ6HIRBUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YI5DSXGKKDV5AY3J4RQ6HIRBUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YI5DSXGKKDV5AY3J4RQ6HIRBUY/action/storage_attestation","attest_author":"https://pith.science/pith/YI5DSXGKKDV5AY3J4RQ6HIRBUY/action/author_attestation","sign_citation":"https://pith.science/pith/YI5DSXGKKDV5AY3J4RQ6HIRBUY/action/citation_signature","submit_replication":"https://pith.science/pith/YI5DSXGKKDV5AY3J4RQ6HIRBUY/action/replication_record"}},"created_at":"2026-07-05T10:59:33.551003+00:00","updated_at":"2026-07-05T10:59:33.551003+00:00"}