{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MBJUKU4TSCX4L4FI4ZJAVZTDZE","short_pith_number":"pith:MBJUKU4T","schema_version":"1.0","canonical_sha256":"605345539390afc5f0a8e6520ae663c93be82305173415a19a3dc69b641779ee","source":{"kind":"arxiv","id":"1709.05263","version":1},"attestation_state":"computed","paper":{"title":"Neighborhood Complexes of Some Exponential Graphs","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-09-14T15:10:25Z","abstract_excerpt":"In this article, we consider the bipartite graphs $K_2 \\times K_n$. We first show that the connectedness of $\\mathcal{N}(K_{n+1}^{K_n}) =0$.\n  Further, we show that $\\text{Hom}(K_2 \\times K_{n}, K_{m})$ is homotopic to $S^{m-2}$, if $2\\leq m <n$."},"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":"1709.05263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-14T15:10:25Z","cross_cats_sorted":[],"title_canon_sha256":"fd3f0671487d202fc7d78e371da4b874d05b0a5cbc955e42ed7f48a4576a287f","abstract_canon_sha256":"7016f1e7449acc8749e693d739c55db920b478b2b42952231d64c273634640c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:06.207068Z","signature_b64":"XDE4Rs9CIOjK3iFkRx8U/Y6VMIrOUEyoHyqhOoDu/dSn0hbg78LbcdqJ8hT+U8PdCjsmfFbho9ijrvzdEnMwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"605345539390afc5f0a8e6520ae663c93be82305173415a19a3dc69b641779ee","last_reissued_at":"2026-05-18T00:35:06.206528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:06.206528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neighborhood Complexes of Some Exponential Graphs","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-09-14T15:10:25Z","abstract_excerpt":"In this article, we consider the bipartite graphs $K_2 \\times K_n$. We first show that the connectedness of $\\mathcal{N}(K_{n+1}^{K_n}) =0$.\n  Further, we show that $\\text{Hom}(K_2 \\times K_{n}, K_{m})$ is homotopic to $S^{m-2}$, if $2\\leq m <n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05263","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":"1709.05263","created_at":"2026-05-18T00:35:06.206609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05263v1","created_at":"2026-05-18T00:35:06.206609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05263","created_at":"2026-05-18T00:35:06.206609+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBJUKU4TSCX4","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBJUKU4TSCX4L4FI","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBJUKU4T","created_at":"2026-05-18T12:31:31.346846+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/MBJUKU4TSCX4L4FI4ZJAVZTDZE","json":"https://pith.science/pith/MBJUKU4TSCX4L4FI4ZJAVZTDZE.json","graph_json":"https://pith.science/api/pith-number/MBJUKU4TSCX4L4FI4ZJAVZTDZE/graph.json","events_json":"https://pith.science/api/pith-number/MBJUKU4TSCX4L4FI4ZJAVZTDZE/events.json","paper":"https://pith.science/paper/MBJUKU4T"},"agent_actions":{"view_html":"https://pith.science/pith/MBJUKU4TSCX4L4FI4ZJAVZTDZE","download_json":"https://pith.science/pith/MBJUKU4TSCX4L4FI4ZJAVZTDZE.json","view_paper":"https://pith.science/paper/MBJUKU4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05263&json=true","fetch_graph":"https://pith.science/api/pith-number/MBJUKU4TSCX4L4FI4ZJAVZTDZE/graph.json","fetch_events":"https://pith.science/api/pith-number/MBJUKU4TSCX4L4FI4ZJAVZTDZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBJUKU4TSCX4L4FI4ZJAVZTDZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBJUKU4TSCX4L4FI4ZJAVZTDZE/action/storage_attestation","attest_author":"https://pith.science/pith/MBJUKU4TSCX4L4FI4ZJAVZTDZE/action/author_attestation","sign_citation":"https://pith.science/pith/MBJUKU4TSCX4L4FI4ZJAVZTDZE/action/citation_signature","submit_replication":"https://pith.science/pith/MBJUKU4TSCX4L4FI4ZJAVZTDZE/action/replication_record"}},"created_at":"2026-05-18T00:35:06.206609+00:00","updated_at":"2026-05-18T00:35:06.206609+00:00"}