{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:57CT3KQ2EUQ6B74P5Y7HFLCGW5","short_pith_number":"pith:57CT3KQ2","schema_version":"1.0","canonical_sha256":"efc53daa1a2521e0ff8fee3e72ac46b7780e57371a153e3c5130a145198dbc4a","source":{"kind":"arxiv","id":"1709.06163","version":2},"attestation_state":"computed","paper":{"title":"Many Triangles with Few Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. J. Radcliffe, R. Kirsch","submitted_at":"2017-09-18T20:43:44Z","abstract_excerpt":"Extremal problems concerning the number of independent sets or complete subgraphs in a graph have been well studied in recent years. Cutler and Radcliffe proved that among graphs with $n$ vertices and maximum degree at most $r$, where $n = a(r+1)+b$ and $0 \\le b \\le r$, $aK_{r+1}\\cup K_b$ has the maximum number of complete subgraphs, answering a question of Galvin. Gan, Loh, and Sudakov conjectured that $aK_{r+1}\\cup K_b$ also maximizes the number of complete subgraphs $K_t$ for each fixed size $t \\ge 3$, and proved this for $a = 1$. Cutler and Radcliffe proved this conjecture for $r \\le 6$.\n "},"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":"1709.06163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-18T20:43:44Z","cross_cats_sorted":[],"title_canon_sha256":"7c0478face0200180ab0cb9dd8e4a85fe14f2de31662414589adec7e22ba6644","abstract_canon_sha256":"eaf55ca0f340dfd636ea60804d07c508d7bb812e4ef780a4d7cdea8f7c05284a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:54.069915Z","signature_b64":"4aYbkCwvQISgot9bEGs5roUC/0P2xFli0+BIBNg06iZTt+mLxVljAmc1weGkqiAFNWmRAx2gAkvemR2tG6/tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efc53daa1a2521e0ff8fee3e72ac46b7780e57371a153e3c5130a145198dbc4a","last_reissued_at":"2026-05-17T23:43:54.069221Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:54.069221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Many Triangles with Few Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. J. Radcliffe, R. Kirsch","submitted_at":"2017-09-18T20:43:44Z","abstract_excerpt":"Extremal problems concerning the number of independent sets or complete subgraphs in a graph have been well studied in recent years. Cutler and Radcliffe proved that among graphs with $n$ vertices and maximum degree at most $r$, where $n = a(r+1)+b$ and $0 \\le b \\le r$, $aK_{r+1}\\cup K_b$ has the maximum number of complete subgraphs, answering a question of Galvin. Gan, Loh, and Sudakov conjectured that $aK_{r+1}\\cup K_b$ also maximizes the number of complete subgraphs $K_t$ for each fixed size $t \\ge 3$, and proved this for $a = 1$. Cutler and Radcliffe proved this conjecture for $r \\le 6$.\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06163","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.06163","created_at":"2026-05-17T23:43:54.069330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06163v2","created_at":"2026-05-17T23:43:54.069330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06163","created_at":"2026-05-17T23:43:54.069330+00:00"},{"alias_kind":"pith_short_12","alias_value":"57CT3KQ2EUQ6","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"57CT3KQ2EUQ6B74P","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"57CT3KQ2","created_at":"2026-05-18T12:31:00.734936+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/57CT3KQ2EUQ6B74P5Y7HFLCGW5","json":"https://pith.science/pith/57CT3KQ2EUQ6B74P5Y7HFLCGW5.json","graph_json":"https://pith.science/api/pith-number/57CT3KQ2EUQ6B74P5Y7HFLCGW5/graph.json","events_json":"https://pith.science/api/pith-number/57CT3KQ2EUQ6B74P5Y7HFLCGW5/events.json","paper":"https://pith.science/paper/57CT3KQ2"},"agent_actions":{"view_html":"https://pith.science/pith/57CT3KQ2EUQ6B74P5Y7HFLCGW5","download_json":"https://pith.science/pith/57CT3KQ2EUQ6B74P5Y7HFLCGW5.json","view_paper":"https://pith.science/paper/57CT3KQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06163&json=true","fetch_graph":"https://pith.science/api/pith-number/57CT3KQ2EUQ6B74P5Y7HFLCGW5/graph.json","fetch_events":"https://pith.science/api/pith-number/57CT3KQ2EUQ6B74P5Y7HFLCGW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57CT3KQ2EUQ6B74P5Y7HFLCGW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57CT3KQ2EUQ6B74P5Y7HFLCGW5/action/storage_attestation","attest_author":"https://pith.science/pith/57CT3KQ2EUQ6B74P5Y7HFLCGW5/action/author_attestation","sign_citation":"https://pith.science/pith/57CT3KQ2EUQ6B74P5Y7HFLCGW5/action/citation_signature","submit_replication":"https://pith.science/pith/57CT3KQ2EUQ6B74P5Y7HFLCGW5/action/replication_record"}},"created_at":"2026-05-17T23:43:54.069330+00:00","updated_at":"2026-05-17T23:43:54.069330+00:00"}