{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JVCXDZJCVI4GS4E5BEFPU3MVU5","short_pith_number":"pith:JVCXDZJC","schema_version":"1.0","canonical_sha256":"4d4571e522aa3869709d090afa6d95a7737523a04b166bffd2e04e8e609d177d","source":{"kind":"arxiv","id":"1306.4818","version":2},"attestation_state":"computed","paper":{"title":"On the chromatic number of a simplicial complex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Konstantin Golubev","submitted_at":"2013-06-20T11:07:34Z","abstract_excerpt":"In [Ho] A.J. Hoffman proved a lower bound on the chromatic number of a graph in the terms of the largest and the smallest eigenvalues of its adjacency matrix. In this paper, we prove a higher dimensional version of this result and give a lower bound on the chromatic number of a pure $d$-dimensional simplicial complex in the terms of the spectra of the higher Laplacian operators."},"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":"1306.4818","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-20T11:07:34Z","cross_cats_sorted":[],"title_canon_sha256":"050a2dbbe213a67dac8de997482f19c418aae23bc7bf47f97a0c544d84d2b25a","abstract_canon_sha256":"8117996cbaf05d28dd69a6bdef3d7b03aab4674bafddb2ab7cec1137d99a53b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:38.575566Z","signature_b64":"sdCf33FySe9WWzLls/8REmmzvFEfi9EOu7K+cinjSEYX2biAm0V04P+Y+KDdf3LtVCseJlWhbVVw5wSulVY/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d4571e522aa3869709d090afa6d95a7737523a04b166bffd2e04e8e609d177d","last_reissued_at":"2026-05-17T23:44:38.575137Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:38.575137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the chromatic number of a simplicial complex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Konstantin Golubev","submitted_at":"2013-06-20T11:07:34Z","abstract_excerpt":"In [Ho] A.J. Hoffman proved a lower bound on the chromatic number of a graph in the terms of the largest and the smallest eigenvalues of its adjacency matrix. In this paper, we prove a higher dimensional version of this result and give a lower bound on the chromatic number of a pure $d$-dimensional simplicial complex in the terms of the spectra of the higher Laplacian operators."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4818","kind":"arxiv","version":2},"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":"1306.4818","created_at":"2026-05-17T23:44:38.575201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4818v2","created_at":"2026-05-17T23:44:38.575201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4818","created_at":"2026-05-17T23:44:38.575201+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVCXDZJCVI4G","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVCXDZJCVI4GS4E5","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVCXDZJC","created_at":"2026-05-18T12:27:49.015174+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/JVCXDZJCVI4GS4E5BEFPU3MVU5","json":"https://pith.science/pith/JVCXDZJCVI4GS4E5BEFPU3MVU5.json","graph_json":"https://pith.science/api/pith-number/JVCXDZJCVI4GS4E5BEFPU3MVU5/graph.json","events_json":"https://pith.science/api/pith-number/JVCXDZJCVI4GS4E5BEFPU3MVU5/events.json","paper":"https://pith.science/paper/JVCXDZJC"},"agent_actions":{"view_html":"https://pith.science/pith/JVCXDZJCVI4GS4E5BEFPU3MVU5","download_json":"https://pith.science/pith/JVCXDZJCVI4GS4E5BEFPU3MVU5.json","view_paper":"https://pith.science/paper/JVCXDZJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4818&json=true","fetch_graph":"https://pith.science/api/pith-number/JVCXDZJCVI4GS4E5BEFPU3MVU5/graph.json","fetch_events":"https://pith.science/api/pith-number/JVCXDZJCVI4GS4E5BEFPU3MVU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVCXDZJCVI4GS4E5BEFPU3MVU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVCXDZJCVI4GS4E5BEFPU3MVU5/action/storage_attestation","attest_author":"https://pith.science/pith/JVCXDZJCVI4GS4E5BEFPU3MVU5/action/author_attestation","sign_citation":"https://pith.science/pith/JVCXDZJCVI4GS4E5BEFPU3MVU5/action/citation_signature","submit_replication":"https://pith.science/pith/JVCXDZJCVI4GS4E5BEFPU3MVU5/action/replication_record"}},"created_at":"2026-05-17T23:44:38.575201+00:00","updated_at":"2026-05-17T23:44:38.575201+00:00"}