{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KOFQCDSLWZAL7FVXMPTOEOGTKM","short_pith_number":"pith:KOFQCDSL","canonical_record":{"source":{"id":"1412.8460","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-29T20:51:23Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"363c7e4cc1b485eda9fcb1ddea301418f636afbe9eb3c158efa651d15beff25a","abstract_canon_sha256":"e77afb6c222db84fb488d4e1aab290e63906e7190d1b08ca2be65c1520f246ff"},"schema_version":"1.0"},"canonical_sha256":"538b010e4bb640bf96b763e6e238d353100884aabbda79f1dac2dc8a29f16fd9","source":{"kind":"arxiv","id":"1412.8460","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8460","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8460v2","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8460","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"KOFQCDSLWZAL","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KOFQCDSLWZAL7FVX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KOFQCDSL","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KOFQCDSLWZAL7FVXMPTOEOGTKM","target":"record","payload":{"canonical_record":{"source":{"id":"1412.8460","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-29T20:51:23Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"363c7e4cc1b485eda9fcb1ddea301418f636afbe9eb3c158efa651d15beff25a","abstract_canon_sha256":"e77afb6c222db84fb488d4e1aab290e63906e7190d1b08ca2be65c1520f246ff"},"schema_version":"1.0"},"canonical_sha256":"538b010e4bb640bf96b763e6e238d353100884aabbda79f1dac2dc8a29f16fd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:17.353302Z","signature_b64":"jIeMtVVvVeTKWOu5TbYMohb/RoxBzzUNqjM034cvcaJollWoYaBYxfqYaM0ZTu9b4gxtcSCWfEXO6/rLcZzYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"538b010e4bb640bf96b763e6e238d353100884aabbda79f1dac2dc8a29f16fd9","last_reissued_at":"2026-05-18T02:30:17.352814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:17.352814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.8460","source_version":2,"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-18T02:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgndSJH6ryccj93HO4BuJoOViLFCebe0BOVg2hArd/SQUy1D0R9AlXMQBdvd6YtYZ3Gpynk7ZB2jXzOs+EQJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:37:29.021813Z"},"content_sha256":"d236ecc83ef51d632e1a409322fb7b928df4cc9694100faa43af971bbd83c472","schema_version":"1.0","event_id":"sha256:d236ecc83ef51d632e1a409322fb7b928df4cc9694100faa43af971bbd83c472"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KOFQCDSLWZAL7FVXMPTOEOGTKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph colouring and the total Betti number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Alexander Engstrom","submitted_at":"2014-12-29T20:51:23Z","abstract_excerpt":"The total Betti number of the independence complex of a graph is an intriguing graph invariant. Kalai and Meshulam have raised the question on its relation to cycles and the chromatic number of a graph, and a recent conjecture on that theme was proved by Bonamy, Charbit and Thomasse. We show an upper bound on the total Betti number in terms of the number of vertex disjoint cycles in a graph. The main technique is discrete Morse theory and building poset maps. Ramanujan graphs with arbitrary chromatic number and girth log(n) is a classical construction. We show that any subgraph of them with le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8460","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"},"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-18T02:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hb84qBXOs0jF+KUVIST6AtIcUkyBGozfNTihMIx1sKPltQ1yV/n5jVvIhoxGS9VXFwT39Pdppb7BLCOi3t4WBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:37:29.022519Z"},"content_sha256":"8678e7da53d1db9f85c2c020d8d6072242d1428dc15ddbbf6df0d6f5747efeaa","schema_version":"1.0","event_id":"sha256:8678e7da53d1db9f85c2c020d8d6072242d1428dc15ddbbf6df0d6f5747efeaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOFQCDSLWZAL7FVXMPTOEOGTKM/bundle.json","state_url":"https://pith.science/pith/KOFQCDSLWZAL7FVXMPTOEOGTKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOFQCDSLWZAL7FVXMPTOEOGTKM/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-12T00:37:29Z","links":{"resolver":"https://pith.science/pith/KOFQCDSLWZAL7FVXMPTOEOGTKM","bundle":"https://pith.science/pith/KOFQCDSLWZAL7FVXMPTOEOGTKM/bundle.json","state":"https://pith.science/pith/KOFQCDSLWZAL7FVXMPTOEOGTKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOFQCDSLWZAL7FVXMPTOEOGTKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KOFQCDSLWZAL7FVXMPTOEOGTKM","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":"e77afb6c222db84fb488d4e1aab290e63906e7190d1b08ca2be65c1520f246ff","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-29T20:51:23Z","title_canon_sha256":"363c7e4cc1b485eda9fcb1ddea301418f636afbe9eb3c158efa651d15beff25a"},"schema_version":"1.0","source":{"id":"1412.8460","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8460","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8460v2","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8460","created_at":"2026-05-18T02:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"KOFQCDSLWZAL","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KOFQCDSLWZAL7FVX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KOFQCDSL","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:8678e7da53d1db9f85c2c020d8d6072242d1428dc15ddbbf6df0d6f5747efeaa","target":"graph","created_at":"2026-05-18T02:30:17Z","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":"The total Betti number of the independence complex of a graph is an intriguing graph invariant. Kalai and Meshulam have raised the question on its relation to cycles and the chromatic number of a graph, and a recent conjecture on that theme was proved by Bonamy, Charbit and Thomasse. We show an upper bound on the total Betti number in terms of the number of vertex disjoint cycles in a graph. The main technique is discrete Morse theory and building poset maps. Ramanujan graphs with arbitrary chromatic number and girth log(n) is a classical construction. We show that any subgraph of them with le","authors_text":"Alexander Engstrom","cross_cats":["math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-29T20:51:23Z","title":"Graph colouring and the total Betti number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8460","kind":"arxiv","version":2},"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:d236ecc83ef51d632e1a409322fb7b928df4cc9694100faa43af971bbd83c472","target":"record","created_at":"2026-05-18T02:30:17Z","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":"e77afb6c222db84fb488d4e1aab290e63906e7190d1b08ca2be65c1520f246ff","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-29T20:51:23Z","title_canon_sha256":"363c7e4cc1b485eda9fcb1ddea301418f636afbe9eb3c158efa651d15beff25a"},"schema_version":"1.0","source":{"id":"1412.8460","kind":"arxiv","version":2}},"canonical_sha256":"538b010e4bb640bf96b763e6e238d353100884aabbda79f1dac2dc8a29f16fd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"538b010e4bb640bf96b763e6e238d353100884aabbda79f1dac2dc8a29f16fd9","first_computed_at":"2026-05-18T02:30:17.352814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:17.352814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jIeMtVVvVeTKWOu5TbYMohb/RoxBzzUNqjM034cvcaJollWoYaBYxfqYaM0ZTu9b4gxtcSCWfEXO6/rLcZzYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:17.353302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8460","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d236ecc83ef51d632e1a409322fb7b928df4cc9694100faa43af971bbd83c472","sha256:8678e7da53d1db9f85c2c020d8d6072242d1428dc15ddbbf6df0d6f5747efeaa"],"state_sha256":"76e24acbd27a9bbf101e96550ab7e67c43faf303a75890d6f532fe7cc6032f33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gRSugDqdx+ImG9PHdRyw0SEOs7FHalYgiagGg7+DQTG+Ra2N8sCBLg5yO9zsyKv7lf5fli6JuLGrjO4e5rYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:37:29.026736Z","bundle_sha256":"48be1a9684a1af5f9e0a968bdb08ae9dfaf6d922758b668fed3a4a24e8dc215a"}}