{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FIJIWWXJ7VDLJMHPH6LCBYT6NX","short_pith_number":"pith:FIJIWWXJ","canonical_record":{"source":{"id":"1405.1322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T15:35:50Z","cross_cats_sorted":[],"title_canon_sha256":"44a9e8fe0398574274fbd4d4bc02532e901d2f152a87f4319a1cbd93e741f1e6","abstract_canon_sha256":"2e84ecb092dd7c0d8a14b5ab7b72931ca436accf4eebd31baa30e37ece07e137"},"schema_version":"1.0"},"canonical_sha256":"2a128b5ae9fd46b4b0ef3f9620e27e6df997bb76227258cd4431caaaea5ef082","source":{"kind":"arxiv","id":"1405.1322","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1322","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1322v1","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1322","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"FIJIWWXJ7VDL","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FIJIWWXJ7VDLJMHP","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FIJIWWXJ","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FIJIWWXJ7VDLJMHPH6LCBYT6NX","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T15:35:50Z","cross_cats_sorted":[],"title_canon_sha256":"44a9e8fe0398574274fbd4d4bc02532e901d2f152a87f4319a1cbd93e741f1e6","abstract_canon_sha256":"2e84ecb092dd7c0d8a14b5ab7b72931ca436accf4eebd31baa30e37ece07e137"},"schema_version":"1.0"},"canonical_sha256":"2a128b5ae9fd46b4b0ef3f9620e27e6df997bb76227258cd4431caaaea5ef082","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:33.066662Z","signature_b64":"m2jC1bUdrindhQBvG9pX1jj27eQjyMqnF+HVSFFKinEDGlI5jmNKE3AcjMxw42VrpNCks/rREi1DJxtu5LLFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a128b5ae9fd46b4b0ef3f9620e27e6df997bb76227258cd4431caaaea5ef082","last_reissued_at":"2026-05-18T02:52:33.066088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:33.066088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1322","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-18T02:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bP389dyEffhtY7M1XGR4emBVCqPEcNXXs9vOhqdtG0UEZHVs6ASBfQpJet96yHd+07HvtBJglyODwUFcbJMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:50:17.085928Z"},"content_sha256":"aad0d961ea4c119e793933170cdfde9e45c2a5453507480531446ff4f218cbd8","schema_version":"1.0","event_id":"sha256:aad0d961ea4c119e793933170cdfde9e45c2a5453507480531446ff4f218cbd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FIJIWWXJ7VDLJMHPH6LCBYT6NX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The maximum number of complete subgraphs of fixed size in a graph with given maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.J. Radcliffe, Jonathan Cutler","submitted_at":"2014-05-06T15:35:50Z","abstract_excerpt":"In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs $G$ with $n$ vertices and $\\Delta(G)\\leq r$, which has the most complete subgraphs of size $t$, for $t\\geq 3$. The conjectured extremal graph is $aK_{r+1}\\cup K_b$, where $n=a(r+1)+b$ with $0\\leq b\\leq r$. Gan, Loh, and Sudakov proved the conjecture when $a\\leq 1$, and also reduced the general conjecture to the case $t=3$. We prove the conjecture for $r\\leq 6$ and also establish a weaker form of the conjecture for all $r$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1322","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-18T02:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l4PpE43ZpybbMjjQ2udRiIpUrBhknUPSA4wAdHpgWUD+LVj0wk7d/ucu62NJ4Zg327lTryBt8iI9AZEjv1N3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:50:17.086297Z"},"content_sha256":"974d44a8d562909e12909aea4b32e2b09cee529fc1cd09fd103d5c9f77d1f6a2","schema_version":"1.0","event_id":"sha256:974d44a8d562909e12909aea4b32e2b09cee529fc1cd09fd103d5c9f77d1f6a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIJIWWXJ7VDLJMHPH6LCBYT6NX/bundle.json","state_url":"https://pith.science/pith/FIJIWWXJ7VDLJMHPH6LCBYT6NX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIJIWWXJ7VDLJMHPH6LCBYT6NX/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-02T17:50:17Z","links":{"resolver":"https://pith.science/pith/FIJIWWXJ7VDLJMHPH6LCBYT6NX","bundle":"https://pith.science/pith/FIJIWWXJ7VDLJMHPH6LCBYT6NX/bundle.json","state":"https://pith.science/pith/FIJIWWXJ7VDLJMHPH6LCBYT6NX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIJIWWXJ7VDLJMHPH6LCBYT6NX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FIJIWWXJ7VDLJMHPH6LCBYT6NX","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":"2e84ecb092dd7c0d8a14b5ab7b72931ca436accf4eebd31baa30e37ece07e137","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T15:35:50Z","title_canon_sha256":"44a9e8fe0398574274fbd4d4bc02532e901d2f152a87f4319a1cbd93e741f1e6"},"schema_version":"1.0","source":{"id":"1405.1322","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1322","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1322v1","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1322","created_at":"2026-05-18T02:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"FIJIWWXJ7VDL","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FIJIWWXJ7VDLJMHP","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FIJIWWXJ","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:974d44a8d562909e12909aea4b32e2b09cee529fc1cd09fd103d5c9f77d1f6a2","target":"graph","created_at":"2026-05-18T02:52:33Z","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 this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs $G$ with $n$ vertices and $\\Delta(G)\\leq r$, which has the most complete subgraphs of size $t$, for $t\\geq 3$. The conjectured extremal graph is $aK_{r+1}\\cup K_b$, where $n=a(r+1)+b$ with $0\\leq b\\leq r$. Gan, Loh, and Sudakov proved the conjecture when $a\\leq 1$, and also reduced the general conjecture to the case $t=3$. We prove the conjecture for $r\\leq 6$ and also establish a weaker form of the conjecture for all $r$","authors_text":"A.J. Radcliffe, Jonathan Cutler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T15:35:50Z","title":"The maximum number of complete subgraphs of fixed size in a graph with given maximum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1322","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:aad0d961ea4c119e793933170cdfde9e45c2a5453507480531446ff4f218cbd8","target":"record","created_at":"2026-05-18T02:52:33Z","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":"2e84ecb092dd7c0d8a14b5ab7b72931ca436accf4eebd31baa30e37ece07e137","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T15:35:50Z","title_canon_sha256":"44a9e8fe0398574274fbd4d4bc02532e901d2f152a87f4319a1cbd93e741f1e6"},"schema_version":"1.0","source":{"id":"1405.1322","kind":"arxiv","version":1}},"canonical_sha256":"2a128b5ae9fd46b4b0ef3f9620e27e6df997bb76227258cd4431caaaea5ef082","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a128b5ae9fd46b4b0ef3f9620e27e6df997bb76227258cd4431caaaea5ef082","first_computed_at":"2026-05-18T02:52:33.066088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:33.066088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m2jC1bUdrindhQBvG9pX1jj27eQjyMqnF+HVSFFKinEDGlI5jmNKE3AcjMxw42VrpNCks/rREi1DJxtu5LLFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:33.066662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1322","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aad0d961ea4c119e793933170cdfde9e45c2a5453507480531446ff4f218cbd8","sha256:974d44a8d562909e12909aea4b32e2b09cee529fc1cd09fd103d5c9f77d1f6a2"],"state_sha256":"2bf854edf54b22df5b5db5458ba2d4b5fa04c43a60c8ae92662d0b7086dbe097"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msxMQcAhTSXGYLr2ZbpOssFOMgY6gQNJQpSoUxwE8uJCmSApMtkZJ7ohAK4aMFPMVoEjZrRx/K2RWCqQr3inAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:50:17.088229Z","bundle_sha256":"a2e33cce73be05f5afa1739cd34f28cb190543037c8cb5e85d700405bc600173"}}