{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7BOOTCKMZB5NMV3BAE7OJ6J5JD","short_pith_number":"pith:7BOOTCKM","schema_version":"1.0","canonical_sha256":"f85ce9894cc87ad65761013ee4f93d48e3979033115e028203c7ae0e3ba1c052","source":{"kind":"arxiv","id":"1502.00776","version":1},"attestation_state":"computed","paper":{"title":"Homomorphisms of binary Cayley graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Claude Tardif, Laurent Beaudou, Reza Naserasr","submitted_at":"2015-02-03T08:26:09Z","abstract_excerpt":"A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic number 3. We strengthen this result first by proving that any non-bipartite binary Cayley graph must contain a projective cube as a subgraph. We further conjecture that any homo- morphism of a non-bipartite binary Cayley graph to a projective cube must be surjective and we prove some special case of this conjecture."},"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":"1502.00776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-03T08:26:09Z","cross_cats_sorted":[],"title_canon_sha256":"b675edca851a08793ad36edf6666da4ed4a949f699d25a61384b2bb8cf785d03","abstract_canon_sha256":"2ef95a6fe4d9f5ce1023f97c1bbcaa39e82f3ed292578036e564d75740f5837e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:04.338418Z","signature_b64":"UJCUapNCPdrsMA0342sLZg4rDBwKkNG7fAIoChfOkOWjue3M06YTYi/tR6k457pkT1EkiPt14I1jXIS/rm8UAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f85ce9894cc87ad65761013ee4f93d48e3979033115e028203c7ae0e3ba1c052","last_reissued_at":"2026-05-18T02:28:04.337998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:04.337998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homomorphisms of binary Cayley graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Claude Tardif, Laurent Beaudou, Reza Naserasr","submitted_at":"2015-02-03T08:26:09Z","abstract_excerpt":"A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic number 3. We strengthen this result first by proving that any non-bipartite binary Cayley graph must contain a projective cube as a subgraph. We further conjecture that any homo- morphism of a non-bipartite binary Cayley graph to a projective cube must be surjective and we prove some special case of this conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00776","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":"1502.00776","created_at":"2026-05-18T02:28:04.338062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00776v1","created_at":"2026-05-18T02:28:04.338062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00776","created_at":"2026-05-18T02:28:04.338062+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BOOTCKMZB5N","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BOOTCKMZB5NMV3B","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BOOTCKM","created_at":"2026-05-18T12:29:07.941421+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/7BOOTCKMZB5NMV3BAE7OJ6J5JD","json":"https://pith.science/pith/7BOOTCKMZB5NMV3BAE7OJ6J5JD.json","graph_json":"https://pith.science/api/pith-number/7BOOTCKMZB5NMV3BAE7OJ6J5JD/graph.json","events_json":"https://pith.science/api/pith-number/7BOOTCKMZB5NMV3BAE7OJ6J5JD/events.json","paper":"https://pith.science/paper/7BOOTCKM"},"agent_actions":{"view_html":"https://pith.science/pith/7BOOTCKMZB5NMV3BAE7OJ6J5JD","download_json":"https://pith.science/pith/7BOOTCKMZB5NMV3BAE7OJ6J5JD.json","view_paper":"https://pith.science/paper/7BOOTCKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00776&json=true","fetch_graph":"https://pith.science/api/pith-number/7BOOTCKMZB5NMV3BAE7OJ6J5JD/graph.json","fetch_events":"https://pith.science/api/pith-number/7BOOTCKMZB5NMV3BAE7OJ6J5JD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BOOTCKMZB5NMV3BAE7OJ6J5JD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BOOTCKMZB5NMV3BAE7OJ6J5JD/action/storage_attestation","attest_author":"https://pith.science/pith/7BOOTCKMZB5NMV3BAE7OJ6J5JD/action/author_attestation","sign_citation":"https://pith.science/pith/7BOOTCKMZB5NMV3BAE7OJ6J5JD/action/citation_signature","submit_replication":"https://pith.science/pith/7BOOTCKMZB5NMV3BAE7OJ6J5JD/action/replication_record"}},"created_at":"2026-05-18T02:28:04.338062+00:00","updated_at":"2026-05-18T02:28:04.338062+00:00"}