{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AMQQORBVPOK4GNUEFJ2TW5OVGM","short_pith_number":"pith:AMQQORBV","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"},"canonical_sha256":"03210744357b95c336842a753b75d533351a2773fb9ee58eea599e802e949321","source":{"kind":"arxiv","id":"1612.07462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07462","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07462v1","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07462","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"pith_short_12","alias_value":"AMQQORBVPOK4","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AMQQORBVPOK4GNUE","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AMQQORBV","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AMQQORBVPOK4GNUEFJ2TW5OVGM","target":"record","payload":{"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"},"canonical_sha256":"03210744357b95c336842a753b75d533351a2773fb9ee58eea599e802e949321","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"},"source_kind":"arxiv","source_id":"1612.07462","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DeZrXYEy0VAu8ZmS6B8ZbmMg3p54rcSypy/VUqko3jPAlxl/S3LfSPRrnoq461NGP9Nqc7WiDdlurANbhq0BBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:44:36.813513Z"},"content_sha256":"659074a52b8bf685495f5f0856a2910832f1bfbc53364d44df70f612bcbd69de","schema_version":"1.0","event_id":"sha256:659074a52b8bf685495f5f0856a2910832f1bfbc53364d44df70f612bcbd69de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AMQQORBVPOK4GNUEFJ2TW5OVGM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kilk/jnmHHTkJenME9YAJR/poeagQljevf7KY1aGvoKAMD0RJMtj7QFs60Yepgmos49yOpN8MfcdB701xcnhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:44:36.813865Z"},"content_sha256":"469e45f5288793bf12a97b68b6897c1bffd71a27e2c1f2a0c47fe769cb1da6e5","schema_version":"1.0","event_id":"sha256:469e45f5288793bf12a97b68b6897c1bffd71a27e2c1f2a0c47fe769cb1da6e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/bundle.json","state_url":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T21:44:36Z","links":{"resolver":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM","bundle":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/bundle.json","state":"https://pith.science/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMQQORBVPOK4GNUEFJ2TW5OVGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AMQQORBVPOK4GNUEFJ2TW5OVGM","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":"f51f63b16d61b53202a0f76f4c736d50a129a19f8d56460c4b9fddf0e71f9e04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-22T06:55:08Z","title_canon_sha256":"884cacd1f2e71d31e1d546a21f73a70da1f012190751351d6bf58387bb37fd96"},"schema_version":"1.0","source":{"id":"1612.07462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07462","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07462v1","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07462","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"pith_short_12","alias_value":"AMQQORBVPOK4","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AMQQORBVPOK4GNUE","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AMQQORBV","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:469e45f5288793bf12a97b68b6897c1bffd71a27e2c1f2a0c47fe769cb1da6e5","target":"graph","created_at":"2026-05-18T00:54:09Z","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"},"paper":{"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","authors_text":"Ali Taherkhani, Meysam Alishahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-22T06:55:08Z","title":"Circular chromatic number of induced subgraphs of Kneser graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07462","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:659074a52b8bf685495f5f0856a2910832f1bfbc53364d44df70f612bcbd69de","target":"record","created_at":"2026-05-18T00:54:09Z","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":"f51f63b16d61b53202a0f76f4c736d50a129a19f8d56460c4b9fddf0e71f9e04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-22T06:55:08Z","title_canon_sha256":"884cacd1f2e71d31e1d546a21f73a70da1f012190751351d6bf58387bb37fd96"},"schema_version":"1.0","source":{"id":"1612.07462","kind":"arxiv","version":1}},"canonical_sha256":"03210744357b95c336842a753b75d533351a2773fb9ee58eea599e802e949321","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03210744357b95c336842a753b75d533351a2773fb9ee58eea599e802e949321","first_computed_at":"2026-05-18T00:54:09.964761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:09.964761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B9rAgdjbXMzEa5z6FNg0upsZ7l4KBEROVr2U7ETH8o007VvuaN11VYI818X0C6Oh7stc7lBWaPZM/ipUduXbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:09.965126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:659074a52b8bf685495f5f0856a2910832f1bfbc53364d44df70f612bcbd69de","sha256:469e45f5288793bf12a97b68b6897c1bffd71a27e2c1f2a0c47fe769cb1da6e5"],"state_sha256":"7150e32749fd66f054abfcc9ceb040b0f09aa7986bdd503cde4451b2fa48db17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1qkm3xI2GSQvtQguK4UEshChHLv54lHXQOwAjDgH5i0YtC8OwRqZp5FDdjjp6j1hCrBoxdeNPl4NlM1lPsUFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:44:36.815869Z","bundle_sha256":"f7ae193d2f63c214831ee8935c54a2cb3a60069b94eb202aee69447974fd3089"}}