{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AMQQORBVPOK4GNUEFJ2TW5OVGM","short_pith_number":"pith:AMQQORBV","schema_version":"1.0","canonical_sha256":"03210744357b95c336842a753b75d533351a2773fb9ee58eea599e802e949321","source":{"kind":"arxiv","id":"1612.07462","version":1},"attestation_state":"computed","paper":{"title":"Circular chromatic number of induced subgraphs of Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Taherkhani, Meysam Alishahi","submitted_at":"2016-12-22T06:55:08Z","abstract_excerpt":"Investigating the equality of the chromatic number and the circular chromatic number of graphs has been an active stream of research for last decades. In this regard, Habolhassan and Zhu [Circular chromatic number of Kneser graphs, Journal of Combinatorial Theory Series B, 2003] proved that if $n$ is sufficiently large with respect to $k$, then the Schrijver graph ${\\rm SG}(n,k)$ has the same chromatic and circular chromatic number. Later, Meunier [A topological lower bound for the circular chromatic number of Schrijver graphs, Journal of Graph Theory, 2005] and independently, Simonyi and Tard"},"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":"1612.07462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-22T06:55:08Z","cross_cats_sorted":[],"title_canon_sha256":"884cacd1f2e71d31e1d546a21f73a70da1f012190751351d6bf58387bb37fd96","abstract_canon_sha256":"f51f63b16d61b53202a0f76f4c736d50a129a19f8d56460c4b9fddf0e71f9e04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:09.965126Z","signature_b64":"B9rAgdjbXMzEa5z6FNg0upsZ7l4KBEROVr2U7ETH8o007VvuaN11VYI818X0C6Oh7stc7lBWaPZM/ipUduXbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03210744357b95c336842a753b75d533351a2773fb9ee58eea599e802e949321","last_reissued_at":"2026-05-18T00:54:09.964761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:09.964761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circular chromatic number of induced subgraphs of Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Taherkhani, Meysam Alishahi","submitted_at":"2016-12-22T06:55:08Z","abstract_excerpt":"Investigating the equality of the chromatic number and the circular chromatic number of graphs has been an active stream of research for last decades. In this regard, Habolhassan and Zhu [Circular chromatic number of Kneser graphs, Journal of Combinatorial Theory Series B, 2003] proved that if $n$ is sufficiently large with respect to $k$, then the Schrijver graph ${\\rm SG}(n,k)$ has the same chromatic and circular chromatic number. Later, Meunier [A topological lower bound for the circular chromatic number of Schrijver graphs, Journal of Graph Theory, 2005] and independently, Simonyi and Tard"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07462","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":"1612.07462","created_at":"2026-05-18T00:54:09.964817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07462v1","created_at":"2026-05-18T00:54:09.964817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07462","created_at":"2026-05-18T00:54:09.964817+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMQQORBVPOK4","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMQQORBVPOK4GNUE","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMQQORBV","created_at":"2026-05-18T12:30:07.202191+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/AMQQORBVPOK4GNUEFJ2TW5OVGM","json":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM.json","graph_json":"https://pith.science/api/pith-number/AMQQORBVPOK4GNUEFJ2TW5OVGM/graph.json","events_json":"https://pith.science/api/pith-number/AMQQORBVPOK4GNUEFJ2TW5OVGM/events.json","paper":"https://pith.science/paper/AMQQORBV"},"agent_actions":{"view_html":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM","download_json":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM.json","view_paper":"https://pith.science/paper/AMQQORBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07462&json=true","fetch_graph":"https://pith.science/api/pith-number/AMQQORBVPOK4GNUEFJ2TW5OVGM/graph.json","fetch_events":"https://pith.science/api/pith-number/AMQQORBVPOK4GNUEFJ2TW5OVGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/action/storage_attestation","attest_author":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/action/author_attestation","sign_citation":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/action/citation_signature","submit_replication":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/action/replication_record"}},"created_at":"2026-05-18T00:54:09.964817+00:00","updated_at":"2026-05-18T00:54:09.964817+00:00"}