{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GRJHBS4AIFQT76KZXYARB3FFFQ","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":"7e7b0be1acd2ce2f297e4dea08fd8aa1f8b1434517bf6faf902242bb6bbabc94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-22T11:31:47Z","title_canon_sha256":"3cf98384492b8ed48fcfea7d65bed98fcd8ddbdb36854a9de89605bd5febf950"},"schema_version":"1.0","source":{"id":"1109.4775","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4775","created_at":"2026-05-18T03:27:52Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4775v4","created_at":"2026-05-18T03:27:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4775","created_at":"2026-05-18T03:27:52Z"},{"alias_kind":"pith_short_12","alias_value":"GRJHBS4AIFQT","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GRJHBS4AIFQT76KZ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GRJHBS4A","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:0d5a5f1bc24dda75ba4976b5f22c8cdf9bac846d7761970c108ad704318aa43c","target":"graph","created_at":"2026-05-18T03:27:52Z","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":"We study the problem of maximizing Betti numbers of simplicial complexes. We prove an upper bound of 1.32^n for the sum of Betti numbers of any n-vertex flag complex and 1.25^n for the independence complex of a triangle-free graph. These findings imply upper bounds for the Betti numbers of various related classes of spaces, including the neighbourhood complex of a graph. We also make some related observations.","authors_text":"Michal Adamaszek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-22T11:31:47Z","title":"Extremal problems related to Betti numbers of flag complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4775","kind":"arxiv","version":4},"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:ad5c9b7e4908861822c0672afb3853409702f883224346f94350eb99dc917ff1","target":"record","created_at":"2026-05-18T03:27:52Z","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":"7e7b0be1acd2ce2f297e4dea08fd8aa1f8b1434517bf6faf902242bb6bbabc94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-22T11:31:47Z","title_canon_sha256":"3cf98384492b8ed48fcfea7d65bed98fcd8ddbdb36854a9de89605bd5febf950"},"schema_version":"1.0","source":{"id":"1109.4775","kind":"arxiv","version":4}},"canonical_sha256":"345270cb8041613ff959be0110eca52c2b227a066433f5d2c90bf74a3d536c2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"345270cb8041613ff959be0110eca52c2b227a066433f5d2c90bf74a3d536c2f","first_computed_at":"2026-05-18T03:27:52.469384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:52.469384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Rxw6DqF5NsWgk94sVRKeesOJgB5gk0hgtArm5Ba8yijkW9YeQXSImhHBfGvirNWTVe1KBY23CEf/VGKagaWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:52.469926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4775","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad5c9b7e4908861822c0672afb3853409702f883224346f94350eb99dc917ff1","sha256:0d5a5f1bc24dda75ba4976b5f22c8cdf9bac846d7761970c108ad704318aa43c"],"state_sha256":"f2c52a82fc5a594fdc51e00754f7c313c20d3aedfb01fd18a2a30a6b4d9a6fc7"}