{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3RF7RRE7PWSPS57GDZW4B6UGWB","short_pith_number":"pith:3RF7RRE7","schema_version":"1.0","canonical_sha256":"dc4bf8c49f7da4f977e61e6dc0fa86b0542f26291c260ea1a0f455c88d27f5fe","source":{"kind":"arxiv","id":"1702.03527","version":1},"attestation_state":"computed","paper":{"title":"Connectedness of Certain Graph Coloring Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nandini Nilakantan, Samir Shukla","submitted_at":"2017-02-12T13:36:10Z","abstract_excerpt":"In this article, we consider the bipartite graphs $K_2 \\times K_n$. We prove that the connectedness of the complex $\\displaystyle \\text{Hom}(K_2\\times K_{n}, K_m) $ is $m-n-1$ if $m \\geq n$ and $m-3$ in the other cases. Therefore, we show that for this class of graphs, $\\text{Hom} (G, K_m)$ is exactly $m-d-2$ connected, $m \\geq n$, where $d$ is the maximal degree of the graph $G$."},"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":"1702.03527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-12T13:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"634184068640963cfa1073256696384ca075b780d5e6aa03d39cc707ffd3fecf","abstract_canon_sha256":"d634cb7df838fb8d98ef50811175bec25b3e8279d95b319cbdb846a4947af2eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:53.573372Z","signature_b64":"kRXjPvmIFVEL8YXxj6/c0xfNAd9X++wAqEEFe2guJYkb+jDH+VK1np3r9ATSmIsts9DlP4RtRP1Wb878IHLoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc4bf8c49f7da4f977e61e6dc0fa86b0542f26291c260ea1a0f455c88d27f5fe","last_reissued_at":"2026-05-18T00:50:53.572812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:53.572812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectedness of Certain Graph Coloring Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nandini Nilakantan, Samir Shukla","submitted_at":"2017-02-12T13:36:10Z","abstract_excerpt":"In this article, we consider the bipartite graphs $K_2 \\times K_n$. We prove that the connectedness of the complex $\\displaystyle \\text{Hom}(K_2\\times K_{n}, K_m) $ is $m-n-1$ if $m \\geq n$ and $m-3$ in the other cases. Therefore, we show that for this class of graphs, $\\text{Hom} (G, K_m)$ is exactly $m-d-2$ connected, $m \\geq n$, where $d$ is the maximal degree of the graph $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03527","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":"1702.03527","created_at":"2026-05-18T00:50:53.572897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03527v1","created_at":"2026-05-18T00:50:53.572897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03527","created_at":"2026-05-18T00:50:53.572897+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RF7RRE7PWSP","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RF7RRE7PWSPS57G","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RF7RRE7","created_at":"2026-05-18T12:30:58.224056+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/3RF7RRE7PWSPS57GDZW4B6UGWB","json":"https://pith.science/pith/3RF7RRE7PWSPS57GDZW4B6UGWB.json","graph_json":"https://pith.science/api/pith-number/3RF7RRE7PWSPS57GDZW4B6UGWB/graph.json","events_json":"https://pith.science/api/pith-number/3RF7RRE7PWSPS57GDZW4B6UGWB/events.json","paper":"https://pith.science/paper/3RF7RRE7"},"agent_actions":{"view_html":"https://pith.science/pith/3RF7RRE7PWSPS57GDZW4B6UGWB","download_json":"https://pith.science/pith/3RF7RRE7PWSPS57GDZW4B6UGWB.json","view_paper":"https://pith.science/paper/3RF7RRE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03527&json=true","fetch_graph":"https://pith.science/api/pith-number/3RF7RRE7PWSPS57GDZW4B6UGWB/graph.json","fetch_events":"https://pith.science/api/pith-number/3RF7RRE7PWSPS57GDZW4B6UGWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RF7RRE7PWSPS57GDZW4B6UGWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RF7RRE7PWSPS57GDZW4B6UGWB/action/storage_attestation","attest_author":"https://pith.science/pith/3RF7RRE7PWSPS57GDZW4B6UGWB/action/author_attestation","sign_citation":"https://pith.science/pith/3RF7RRE7PWSPS57GDZW4B6UGWB/action/citation_signature","submit_replication":"https://pith.science/pith/3RF7RRE7PWSPS57GDZW4B6UGWB/action/replication_record"}},"created_at":"2026-05-18T00:50:53.572897+00:00","updated_at":"2026-05-18T00:50:53.572897+00:00"}