{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XSPALUM4SSSOK42CHA7YPU4ZDZ","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":"ef904514f0d90caa636c373b29697a50bfeadad9a69d9d1ab2056b3b8795ce5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-07T18:29:51Z","title_canon_sha256":"043c38591a325ab266816af73c967c05d508c0a0a6b5aac82fc6900595690240"},"schema_version":"1.0","source":{"id":"1306.1803","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1803","created_at":"2026-05-18T03:21:32Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1803v1","created_at":"2026-05-18T03:21:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1803","created_at":"2026-05-18T03:21:32Z"},{"alias_kind":"pith_short_12","alias_value":"XSPALUM4SSSO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XSPALUM4SSSOK42C","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XSPALUM4","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:732e5edbde9ed76ddddd721359d62c4df419a6e9ea41bddd494cb26aab2fb9c9","target":"graph","created_at":"2026-05-18T03:21:32Z","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":"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","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":"2013-06-07T18:29:51Z","title":"The maximum number of complete subgraphs in a graph with given maximum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1803","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:34c653b9788c4b9932204fcb479a04cb96c7f75fa6c14f08ed59964b86dc95a9","target":"record","created_at":"2026-05-18T03:21:32Z","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":"ef904514f0d90caa636c373b29697a50bfeadad9a69d9d1ab2056b3b8795ce5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-07T18:29:51Z","title_canon_sha256":"043c38591a325ab266816af73c967c05d508c0a0a6b5aac82fc6900595690240"},"schema_version":"1.0","source":{"id":"1306.1803","kind":"arxiv","version":1}},"canonical_sha256":"bc9e05d19c94a4e57342383f87d3991e60df9c8fbde5370b9532051523f77f17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc9e05d19c94a4e57342383f87d3991e60df9c8fbde5370b9532051523f77f17","first_computed_at":"2026-05-18T03:21:32.301603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:32.301603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xUCCjggtLxgoLaSqI4qJfGVeulgDFsP0F+d/Rer24kFLyKZCLzf6klC84tjD4nZ6Gk2uWEpDi65WAwUrWp9sDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:32.302444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1803","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34c653b9788c4b9932204fcb479a04cb96c7f75fa6c14f08ed59964b86dc95a9","sha256:732e5edbde9ed76ddddd721359d62c4df419a6e9ea41bddd494cb26aab2fb9c9"],"state_sha256":"3a7a8f802e24893f7bbb3c7775c59a0dd6899806e85bd60be7b57591ce00df50"}