{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2S74ZV3LVWXNNVF4SPS5FJAWQM","short_pith_number":"pith:2S74ZV3L","schema_version":"1.0","canonical_sha256":"d4bfccd76badaed6d4bc93e5d2a41683348592925e37408b1f0763974f38f63b","source":{"kind":"arxiv","id":"1610.05714","version":1},"attestation_state":"computed","paper":{"title":"Minimizing the number of independent sets in triangle-free regular graphs","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":"2016-10-18T17:30:55Z","abstract_excerpt":"Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in various parts, to Kahn, Galvin-Tetali, and Zhao) that the independence polynomial of a $d$-regular graph is maximized by disjoint copies of $K_{d,d}$. Their proof uses linear programming bounds on the distribution of a cleverly chosen random variable. In this paper, we use this method to give lower bounds on the independence polynomial of regular graphs. We also give new bounds on the number of independent sets in triangle-free regular graphs."},"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":"1610.05714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-18T17:30:55Z","cross_cats_sorted":[],"title_canon_sha256":"ac274cb4fac2d382456625b8664a6054124e536ae4b9ec487c3e15fea3fac1b7","abstract_canon_sha256":"5559fa8b925740897394878663b546544b17b16bfd660694cc6d44a681888d31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:58.554349Z","signature_b64":"CDlfVNCI8i8HiyyqSuBPiIJFkVB/OR01lP5ZTNA8+RyhYAQ5w1KUs+VgvDRCbaZ91/YweyfizgRHbCpsByazCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4bfccd76badaed6d4bc93e5d2a41683348592925e37408b1f0763974f38f63b","last_reissued_at":"2026-05-18T01:01:58.553585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:58.553585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing the number of independent sets in triangle-free regular graphs","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":"2016-10-18T17:30:55Z","abstract_excerpt":"Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in various parts, to Kahn, Galvin-Tetali, and Zhao) that the independence polynomial of a $d$-regular graph is maximized by disjoint copies of $K_{d,d}$. Their proof uses linear programming bounds on the distribution of a cleverly chosen random variable. In this paper, we use this method to give lower bounds on the independence polynomial of regular graphs. We also give new bounds on the number of independent sets in triangle-free regular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05714","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":"1610.05714","created_at":"2026-05-18T01:01:58.553719+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05714v1","created_at":"2026-05-18T01:01:58.553719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05714","created_at":"2026-05-18T01:01:58.553719+00:00"},{"alias_kind":"pith_short_12","alias_value":"2S74ZV3LVWXN","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2S74ZV3LVWXNNVF4","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2S74ZV3L","created_at":"2026-05-18T12:29:55.572404+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/2S74ZV3LVWXNNVF4SPS5FJAWQM","json":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM.json","graph_json":"https://pith.science/api/pith-number/2S74ZV3LVWXNNVF4SPS5FJAWQM/graph.json","events_json":"https://pith.science/api/pith-number/2S74ZV3LVWXNNVF4SPS5FJAWQM/events.json","paper":"https://pith.science/paper/2S74ZV3L"},"agent_actions":{"view_html":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM","download_json":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM.json","view_paper":"https://pith.science/paper/2S74ZV3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05714&json=true","fetch_graph":"https://pith.science/api/pith-number/2S74ZV3LVWXNNVF4SPS5FJAWQM/graph.json","fetch_events":"https://pith.science/api/pith-number/2S74ZV3LVWXNNVF4SPS5FJAWQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/action/storage_attestation","attest_author":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/action/author_attestation","sign_citation":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/action/citation_signature","submit_replication":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/action/replication_record"}},"created_at":"2026-05-18T01:01:58.553719+00:00","updated_at":"2026-05-18T01:01:58.553719+00:00"}