{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XSPALUM4SSSOK42CHA7YPU4ZDZ","short_pith_number":"pith:XSPALUM4","schema_version":"1.0","canonical_sha256":"bc9e05d19c94a4e57342383f87d3991e60df9c8fbde5370b9532051523f77f17","source":{"kind":"arxiv","id":"1306.1803","version":1},"attestation_state":"computed","paper":{"title":"The maximum number of complete subgraphs 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":"2013-06-07T18:29:51Z","abstract_excerpt":"Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a $d$-regular graph on $n$ vertices is at most $(2^{d+1}-1)^{n/2d}$ by the Kahn-Zhao theorem. Relaxing the regularity constraint to a minimum degree condition, Galvin conjectured that, for $n\\geq 2d$, the number of independent sets in a graph with $\\delta(G)\\geq d$ is at most that in $K_{d,n-d}$.\n  In this paper, we give a lower bound on the number of independent sets in a $d$-regular graph mirroring the upper bound in the Kahn-Zhao theorem. The"},"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":"1306.1803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-07T18:29:51Z","cross_cats_sorted":[],"title_canon_sha256":"043c38591a325ab266816af73c967c05d508c0a0a6b5aac82fc6900595690240","abstract_canon_sha256":"ef904514f0d90caa636c373b29697a50bfeadad9a69d9d1ab2056b3b8795ce5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:32.302444Z","signature_b64":"xUCCjggtLxgoLaSqI4qJfGVeulgDFsP0F+d/Rer24kFLyKZCLzf6klC84tjD4nZ6Gk2uWEpDi65WAwUrWp9sDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc9e05d19c94a4e57342383f87d3991e60df9c8fbde5370b9532051523f77f17","last_reissued_at":"2026-05-18T03:21:32.301603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:32.301603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum number of complete subgraphs 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":"2013-06-07T18:29:51Z","abstract_excerpt":"Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a $d$-regular graph on $n$ vertices is at most $(2^{d+1}-1)^{n/2d}$ by the Kahn-Zhao theorem. Relaxing the regularity constraint to a minimum degree condition, Galvin conjectured that, for $n\\geq 2d$, the number of independent sets in a graph with $\\delta(G)\\geq d$ is at most that in $K_{d,n-d}$.\n  In this paper, we give a lower bound on the number of independent sets in a $d$-regular graph mirroring the upper bound in the Kahn-Zhao theorem. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1803","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.1803","created_at":"2026-05-18T03:21:32.301743+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1803v1","created_at":"2026-05-18T03:21:32.301743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1803","created_at":"2026-05-18T03:21:32.301743+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSPALUM4SSSO","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSPALUM4SSSOK42C","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSPALUM4","created_at":"2026-05-18T12:28:06.772260+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/XSPALUM4SSSOK42CHA7YPU4ZDZ","json":"https://pith.science/pith/XSPALUM4SSSOK42CHA7YPU4ZDZ.json","graph_json":"https://pith.science/api/pith-number/XSPALUM4SSSOK42CHA7YPU4ZDZ/graph.json","events_json":"https://pith.science/api/pith-number/XSPALUM4SSSOK42CHA7YPU4ZDZ/events.json","paper":"https://pith.science/paper/XSPALUM4"},"agent_actions":{"view_html":"https://pith.science/pith/XSPALUM4SSSOK42CHA7YPU4ZDZ","download_json":"https://pith.science/pith/XSPALUM4SSSOK42CHA7YPU4ZDZ.json","view_paper":"https://pith.science/paper/XSPALUM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1803&json=true","fetch_graph":"https://pith.science/api/pith-number/XSPALUM4SSSOK42CHA7YPU4ZDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XSPALUM4SSSOK42CHA7YPU4ZDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSPALUM4SSSOK42CHA7YPU4ZDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSPALUM4SSSOK42CHA7YPU4ZDZ/action/storage_attestation","attest_author":"https://pith.science/pith/XSPALUM4SSSOK42CHA7YPU4ZDZ/action/author_attestation","sign_citation":"https://pith.science/pith/XSPALUM4SSSOK42CHA7YPU4ZDZ/action/citation_signature","submit_replication":"https://pith.science/pith/XSPALUM4SSSOK42CHA7YPU4ZDZ/action/replication_record"}},"created_at":"2026-05-18T03:21:32.301743+00:00","updated_at":"2026-05-18T03:21:32.301743+00:00"}