{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GRJHBS4AIFQT76KZXYARB3FFFQ","short_pith_number":"pith:GRJHBS4A","schema_version":"1.0","canonical_sha256":"345270cb8041613ff959be0110eca52c2b227a066433f5d2c90bf74a3d536c2f","source":{"kind":"arxiv","id":"1109.4775","version":4},"attestation_state":"computed","paper":{"title":"Extremal problems related to Betti numbers of flag complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michal Adamaszek","submitted_at":"2011-09-22T11:31:47Z","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."},"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":"1109.4775","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-22T11:31:47Z","cross_cats_sorted":[],"title_canon_sha256":"3cf98384492b8ed48fcfea7d65bed98fcd8ddbdb36854a9de89605bd5febf950","abstract_canon_sha256":"7e7b0be1acd2ce2f297e4dea08fd8aa1f8b1434517bf6faf902242bb6bbabc94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:52.469926Z","signature_b64":"8Rxw6DqF5NsWgk94sVRKeesOJgB5gk0hgtArm5Ba8yijkW9YeQXSImhHBfGvirNWTVe1KBY23CEf/VGKagaWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"345270cb8041613ff959be0110eca52c2b227a066433f5d2c90bf74a3d536c2f","last_reissued_at":"2026-05-18T03:27:52.469384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:52.469384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal problems related to Betti numbers of flag complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michal Adamaszek","submitted_at":"2011-09-22T11:31:47Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4775","kind":"arxiv","version":4},"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":"1109.4775","created_at":"2026-05-18T03:27:52.469471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4775v4","created_at":"2026-05-18T03:27:52.469471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4775","created_at":"2026-05-18T03:27:52.469471+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRJHBS4AIFQT","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRJHBS4AIFQT76KZ","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRJHBS4A","created_at":"2026-05-18T12:26:30.835961+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/GRJHBS4AIFQT76KZXYARB3FFFQ","json":"https://pith.science/pith/GRJHBS4AIFQT76KZXYARB3FFFQ.json","graph_json":"https://pith.science/api/pith-number/GRJHBS4AIFQT76KZXYARB3FFFQ/graph.json","events_json":"https://pith.science/api/pith-number/GRJHBS4AIFQT76KZXYARB3FFFQ/events.json","paper":"https://pith.science/paper/GRJHBS4A"},"agent_actions":{"view_html":"https://pith.science/pith/GRJHBS4AIFQT76KZXYARB3FFFQ","download_json":"https://pith.science/pith/GRJHBS4AIFQT76KZXYARB3FFFQ.json","view_paper":"https://pith.science/paper/GRJHBS4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4775&json=true","fetch_graph":"https://pith.science/api/pith-number/GRJHBS4AIFQT76KZXYARB3FFFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GRJHBS4AIFQT76KZXYARB3FFFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRJHBS4AIFQT76KZXYARB3FFFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRJHBS4AIFQT76KZXYARB3FFFQ/action/storage_attestation","attest_author":"https://pith.science/pith/GRJHBS4AIFQT76KZXYARB3FFFQ/action/author_attestation","sign_citation":"https://pith.science/pith/GRJHBS4AIFQT76KZXYARB3FFFQ/action/citation_signature","submit_replication":"https://pith.science/pith/GRJHBS4AIFQT76KZXYARB3FFFQ/action/replication_record"}},"created_at":"2026-05-18T03:27:52.469471+00:00","updated_at":"2026-05-18T03:27:52.469471+00:00"}