{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TP6XXMAKRDXZSYWEYL7ZH2WIRU","short_pith_number":"pith:TP6XXMAK","schema_version":"1.0","canonical_sha256":"9bfd7bb00a88ef9962c4c2ff93eac88d33b53d0c221795960a563ccb2cc32b0a","source":{"kind":"arxiv","id":"1805.09394","version":1},"attestation_state":"computed","paper":{"title":"Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danila Cherkashin, Jozsef Balogh, Sergei Kiselev","submitted_at":"2018-05-23T19:31:09Z","abstract_excerpt":"We suggest a new method on coloring generalized Kneser graphs based on hypergraphs with high discrepancy and small number of edges. The main result is providing a proper coloring of K(n, n/2-t, s) in (4 + o(1))(s + t)^2 colors, which is produced by Hadamard matrices. Also, we show that for colorings by independent set of a natural type, this result is the best possible up to a multiplicative constant. Our method extends to Kneser hypergraphs as well."},"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":"1805.09394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-23T19:31:09Z","cross_cats_sorted":[],"title_canon_sha256":"ddf99e533b458221591cf8c8abeeac8742b0abe270762b66fb79cb208fd88018","abstract_canon_sha256":"3096ded4608d8d768266381b90a52b93c3b6f22d7c04b13a865d312e2bcb11ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:04.157377Z","signature_b64":"cIsfWxVJovrLgIhptnMj8z8PmeViTWaE36Cu9pBxzxcnXCBbVkeCZZGn07EMG7D7/ss4exifcTitHbpp9K2EBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bfd7bb00a88ef9962c4c2ff93eac88d33b53d0c221795960a563ccb2cc32b0a","last_reissued_at":"2026-05-18T00:15:04.156838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:04.156838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danila Cherkashin, Jozsef Balogh, Sergei Kiselev","submitted_at":"2018-05-23T19:31:09Z","abstract_excerpt":"We suggest a new method on coloring generalized Kneser graphs based on hypergraphs with high discrepancy and small number of edges. The main result is providing a proper coloring of K(n, n/2-t, s) in (4 + o(1))(s + t)^2 colors, which is produced by Hadamard matrices. Also, we show that for colorings by independent set of a natural type, this result is the best possible up to a multiplicative constant. Our method extends to Kneser hypergraphs as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09394","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":""},"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":"1805.09394","created_at":"2026-05-18T00:15:04.156922+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09394v1","created_at":"2026-05-18T00:15:04.156922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09394","created_at":"2026-05-18T00:15:04.156922+00:00"},{"alias_kind":"pith_short_12","alias_value":"TP6XXMAKRDXZ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TP6XXMAKRDXZSYWE","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TP6XXMAK","created_at":"2026-05-18T12:32:53.628368+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/TP6XXMAKRDXZSYWEYL7ZH2WIRU","json":"https://pith.science/pith/TP6XXMAKRDXZSYWEYL7ZH2WIRU.json","graph_json":"https://pith.science/api/pith-number/TP6XXMAKRDXZSYWEYL7ZH2WIRU/graph.json","events_json":"https://pith.science/api/pith-number/TP6XXMAKRDXZSYWEYL7ZH2WIRU/events.json","paper":"https://pith.science/paper/TP6XXMAK"},"agent_actions":{"view_html":"https://pith.science/pith/TP6XXMAKRDXZSYWEYL7ZH2WIRU","download_json":"https://pith.science/pith/TP6XXMAKRDXZSYWEYL7ZH2WIRU.json","view_paper":"https://pith.science/paper/TP6XXMAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09394&json=true","fetch_graph":"https://pith.science/api/pith-number/TP6XXMAKRDXZSYWEYL7ZH2WIRU/graph.json","fetch_events":"https://pith.science/api/pith-number/TP6XXMAKRDXZSYWEYL7ZH2WIRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TP6XXMAKRDXZSYWEYL7ZH2WIRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TP6XXMAKRDXZSYWEYL7ZH2WIRU/action/storage_attestation","attest_author":"https://pith.science/pith/TP6XXMAKRDXZSYWEYL7ZH2WIRU/action/author_attestation","sign_citation":"https://pith.science/pith/TP6XXMAKRDXZSYWEYL7ZH2WIRU/action/citation_signature","submit_replication":"https://pith.science/pith/TP6XXMAKRDXZSYWEYL7ZH2WIRU/action/replication_record"}},"created_at":"2026-05-18T00:15:04.156922+00:00","updated_at":"2026-05-18T00:15:04.156922+00:00"}