{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PIDFWG7X66FYDSHG335DN2NUSH","short_pith_number":"pith:PIDFWG7X","canonical_record":{"source":{"id":"1810.04345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T02:48:56Z","cross_cats_sorted":[],"title_canon_sha256":"c726a55ae5d7a6bd3c3afe42d2cf9a6afea5aa7d1f61e05ce7909a10dc944716","abstract_canon_sha256":"feb21fec4dec3471a1cb206cdb6dcf289b1354b53ff5eef4bdf0ea3748d16d44"},"schema_version":"1.0"},"canonical_sha256":"7a065b1bf7f78b81c8e6defa36e9b491e4aa493eb87e4fac45aea78bd7cfe7a5","source":{"kind":"arxiv","id":"1810.04345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04345","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04345v1","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04345","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"PIDFWG7X66FY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PIDFWG7X66FYDSHG","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PIDFWG7X","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PIDFWG7X66FYDSHG335DN2NUSH","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T02:48:56Z","cross_cats_sorted":[],"title_canon_sha256":"c726a55ae5d7a6bd3c3afe42d2cf9a6afea5aa7d1f61e05ce7909a10dc944716","abstract_canon_sha256":"feb21fec4dec3471a1cb206cdb6dcf289b1354b53ff5eef4bdf0ea3748d16d44"},"schema_version":"1.0"},"canonical_sha256":"7a065b1bf7f78b81c8e6defa36e9b491e4aa493eb87e4fac45aea78bd7cfe7a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:40.362370Z","signature_b64":"dAOfFEAF3+kgJwGHwFMrEnMqPBmsHvLjkOZh34SRUZbNaigLCH478cmVzzAPTrce6aRr7OB5FBldPiIZzYypAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a065b1bf7f78b81c8e6defa36e9b491e4aa493eb87e4fac45aea78bd7cfe7a5","last_reissued_at":"2026-05-18T00:03:40.361920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:40.361920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04345","source_version":1,"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-18T00:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQp4nt8qQIHQKLz66hN8n+0KqA+hibNpnxKcVsPIYtr3e2BC6Lt/qNVfZRfEIbSN0jogUUpt5y18S6DuWiZIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:04:05.767548Z"},"content_sha256":"7f9ae63dc97d36c7761e1823dc743b65540244aa07e90737fba7428ff53907d1","schema_version":"1.0","event_id":"sha256:7f9ae63dc97d36c7761e1823dc743b65540244aa07e90737fba7428ff53907d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PIDFWG7X66FYDSHG335DN2NUSH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing Cliques in Shellable Clique Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Corbin Groothuis","submitted_at":"2018-10-10T02:48:56Z","abstract_excerpt":"In extremal graph theory, the problem of finding the elements of a given class of graphs which contain the most cliques traces its routes back to Tur\\'an's famous theorem. We consider the implications of the connectivity property of simplicial complexes known as shellability on clique complexes associated with graphs. In this paper, we find the graphs which maximize cliques among all graphs on $n$ vertices with $\\Delta(G)\\leq r$ that have shellable clique complexes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04345","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"},"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-18T00:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"toajVeTtVFQs2xWM7u1onMjZLVYvayfKHPiltEKbiBqapmmRM4lW9ph2jUuS710oKz+NzNMh9rJlZsaU40yrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:04:05.767867Z"},"content_sha256":"9842462304d2557357c3682f096d77d86daf39c65c3c6d03ba3a29203fa4cc09","schema_version":"1.0","event_id":"sha256:9842462304d2557357c3682f096d77d86daf39c65c3c6d03ba3a29203fa4cc09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PIDFWG7X66FYDSHG335DN2NUSH/bundle.json","state_url":"https://pith.science/pith/PIDFWG7X66FYDSHG335DN2NUSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PIDFWG7X66FYDSHG335DN2NUSH/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-23T00:04:05Z","links":{"resolver":"https://pith.science/pith/PIDFWG7X66FYDSHG335DN2NUSH","bundle":"https://pith.science/pith/PIDFWG7X66FYDSHG335DN2NUSH/bundle.json","state":"https://pith.science/pith/PIDFWG7X66FYDSHG335DN2NUSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PIDFWG7X66FYDSHG335DN2NUSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PIDFWG7X66FYDSHG335DN2NUSH","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":"feb21fec4dec3471a1cb206cdb6dcf289b1354b53ff5eef4bdf0ea3748d16d44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T02:48:56Z","title_canon_sha256":"c726a55ae5d7a6bd3c3afe42d2cf9a6afea5aa7d1f61e05ce7909a10dc944716"},"schema_version":"1.0","source":{"id":"1810.04345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04345","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04345v1","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04345","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"PIDFWG7X66FY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PIDFWG7X66FYDSHG","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PIDFWG7X","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:9842462304d2557357c3682f096d77d86daf39c65c3c6d03ba3a29203fa4cc09","target":"graph","created_at":"2026-05-18T00:03:40Z","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":"In extremal graph theory, the problem of finding the elements of a given class of graphs which contain the most cliques traces its routes back to Tur\\'an's famous theorem. We consider the implications of the connectivity property of simplicial complexes known as shellability on clique complexes associated with graphs. In this paper, we find the graphs which maximize cliques among all graphs on $n$ vertices with $\\Delta(G)\\leq r$ that have shellable clique complexes.","authors_text":"Corbin Groothuis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T02:48:56Z","title":"Maximizing Cliques in Shellable Clique Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04345","kind":"arxiv","version":1},"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:7f9ae63dc97d36c7761e1823dc743b65540244aa07e90737fba7428ff53907d1","target":"record","created_at":"2026-05-18T00:03:40Z","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":"feb21fec4dec3471a1cb206cdb6dcf289b1354b53ff5eef4bdf0ea3748d16d44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T02:48:56Z","title_canon_sha256":"c726a55ae5d7a6bd3c3afe42d2cf9a6afea5aa7d1f61e05ce7909a10dc944716"},"schema_version":"1.0","source":{"id":"1810.04345","kind":"arxiv","version":1}},"canonical_sha256":"7a065b1bf7f78b81c8e6defa36e9b491e4aa493eb87e4fac45aea78bd7cfe7a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a065b1bf7f78b81c8e6defa36e9b491e4aa493eb87e4fac45aea78bd7cfe7a5","first_computed_at":"2026-05-18T00:03:40.361920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:40.361920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dAOfFEAF3+kgJwGHwFMrEnMqPBmsHvLjkOZh34SRUZbNaigLCH478cmVzzAPTrce6aRr7OB5FBldPiIZzYypAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:40.362370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f9ae63dc97d36c7761e1823dc743b65540244aa07e90737fba7428ff53907d1","sha256:9842462304d2557357c3682f096d77d86daf39c65c3c6d03ba3a29203fa4cc09"],"state_sha256":"bc2b4cbcf76afdfc1c16f48c6ea147ddc6f855fe36b5a33d429c4c767765f3f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRoaH2p0kfFLxPpFvfsrcC6Q4Vw57oj7LEmJtY1lrt4Z3pxufMVYbM7i73Wx4we7nm0Z0XIDn8rCa0rZyYN+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:04:05.769667Z","bundle_sha256":"2b42448bc4a713cbbff6e9349cc79081712b9bc228eea57292ac692e923c4229"}}