{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4IYEQF7UBAMJACB6XLARJGEUE2","short_pith_number":"pith:4IYEQF7U","schema_version":"1.0","canonical_sha256":"e2304817f4081890083ebac114989426abda8c0b5d42c08cbdccb1d011cac695","source":{"kind":"arxiv","id":"2505.22055","version":1},"attestation_state":"computed","paper":{"title":"On the Chromatic Number of Grassmann Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jozefien D'haeseleer, Vladislav Taranchuk","submitted_at":"2025-05-28T07:24:56Z","abstract_excerpt":"In this paper we study the chromatic number of the Grassmann graphs $J_q(n, m)$. We show that $\\binom{n-m+1}{1}_q \\leq \\chi(J_q(n, m)) \\leq \\binom{n}{1}_q$, which is analogous to the best-known bounds for the chromatic number of the Johnson graphs $J(n, m)$. When $m = 2$, determining $\\chi(J_q(n, 2))$ is equivalent to determining the smallest number of partial line parallelisms that one can partition the lines of PG$(n-1, q)$ into. We survey known results about line parallelisms and their implications for $\\chi(J_q(n, 2))$. Finally, we prove that when $q$ is any power of two, and $n$ is any ev"},"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.22055","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-28T07:24:56Z","cross_cats_sorted":[],"title_canon_sha256":"54ad66e5125ca22bd86d5ada9a8bc8e3d435648ceb6eb2aa13fc327c21c7974a","abstract_canon_sha256":"341170400c64950b442cbebca2c16b34b4ab6f0378fc21bcef3da945f54589f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:08.876459Z","signature_b64":"QnnERmqWynt1n0O6kd4lNs5VkiFmLQWmZo9uk9Hmziq4J1aP7WKe7Dwm52H/iLOQfQ9qXWyKMYrVuSo4hdXMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2304817f4081890083ebac114989426abda8c0b5d42c08cbdccb1d011cac695","last_reissued_at":"2026-07-05T11:11:08.875933Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:08.875933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Chromatic Number of Grassmann Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jozefien D'haeseleer, Vladislav Taranchuk","submitted_at":"2025-05-28T07:24:56Z","abstract_excerpt":"In this paper we study the chromatic number of the Grassmann graphs $J_q(n, m)$. We show that $\\binom{n-m+1}{1}_q \\leq \\chi(J_q(n, m)) \\leq \\binom{n}{1}_q$, which is analogous to the best-known bounds for the chromatic number of the Johnson graphs $J(n, m)$. When $m = 2$, determining $\\chi(J_q(n, 2))$ is equivalent to determining the smallest number of partial line parallelisms that one can partition the lines of PG$(n-1, q)$ into. We survey known results about line parallelisms and their implications for $\\chi(J_q(n, 2))$. Finally, we prove that when $q$ is any power of two, and $n$ is any ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22055","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.22055/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.22055","created_at":"2026-07-05T11:11:08.875999+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22055v1","created_at":"2026-07-05T11:11:08.875999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22055","created_at":"2026-07-05T11:11:08.875999+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IYEQF7UBAMJ","created_at":"2026-07-05T11:11:08.875999+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IYEQF7UBAMJACB6","created_at":"2026-07-05T11:11:08.875999+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IYEQF7U","created_at":"2026-07-05T11:11:08.875999+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22958","citing_title":"On Reed-Muller subcodes, Grassmannian partitions and sum-free functions","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4IYEQF7UBAMJACB6XLARJGEUE2","json":"https://pith.science/pith/4IYEQF7UBAMJACB6XLARJGEUE2.json","graph_json":"https://pith.science/api/pith-number/4IYEQF7UBAMJACB6XLARJGEUE2/graph.json","events_json":"https://pith.science/api/pith-number/4IYEQF7UBAMJACB6XLARJGEUE2/events.json","paper":"https://pith.science/paper/4IYEQF7U"},"agent_actions":{"view_html":"https://pith.science/pith/4IYEQF7UBAMJACB6XLARJGEUE2","download_json":"https://pith.science/pith/4IYEQF7UBAMJACB6XLARJGEUE2.json","view_paper":"https://pith.science/paper/4IYEQF7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22055&json=true","fetch_graph":"https://pith.science/api/pith-number/4IYEQF7UBAMJACB6XLARJGEUE2/graph.json","fetch_events":"https://pith.science/api/pith-number/4IYEQF7UBAMJACB6XLARJGEUE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IYEQF7UBAMJACB6XLARJGEUE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IYEQF7UBAMJACB6XLARJGEUE2/action/storage_attestation","attest_author":"https://pith.science/pith/4IYEQF7UBAMJACB6XLARJGEUE2/action/author_attestation","sign_citation":"https://pith.science/pith/4IYEQF7UBAMJACB6XLARJGEUE2/action/citation_signature","submit_replication":"https://pith.science/pith/4IYEQF7UBAMJACB6XLARJGEUE2/action/replication_record"}},"created_at":"2026-07-05T11:11:08.875999+00:00","updated_at":"2026-07-05T11:11:08.875999+00:00"}