{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2S74ZV3LVWXNNVF4SPS5FJAWQM","short_pith_number":"pith:2S74ZV3L","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"},"canonical_sha256":"d4bfccd76badaed6d4bc93e5d2a41683348592925e37408b1f0763974f38f63b","source":{"kind":"arxiv","id":"1610.05714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05714","created_at":"2026-05-18T01:01:58Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05714v1","created_at":"2026-05-18T01:01:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05714","created_at":"2026-05-18T01:01:58Z"},{"alias_kind":"pith_short_12","alias_value":"2S74ZV3LVWXN","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2S74ZV3LVWXNNVF4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2S74ZV3L","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2S74ZV3LVWXNNVF4SPS5FJAWQM","target":"record","payload":{"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"},"canonical_sha256":"d4bfccd76badaed6d4bc93e5d2a41683348592925e37408b1f0763974f38f63b","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"},"source_kind":"arxiv","source_id":"1610.05714","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-18T01:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XvKqH/n5eQ94jGy3j+UBRNGeViNMEe2h1WwoQALXUJ0UIQDOyBj+JBmddMepXLg/xa5YxHtqdkgaG5fCiKd4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:43:22.548278Z"},"content_sha256":"09af717edd00548ef06592f0352014b653ff06a4c1ab049a71e96a2fa9677118","schema_version":"1.0","event_id":"sha256:09af717edd00548ef06592f0352014b653ff06a4c1ab049a71e96a2fa9677118"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2S74ZV3LVWXNNVF4SPS5FJAWQM","target":"graph","payload":{"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"},"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-18T01:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VT+UIzcOIF2ZW+rJ1K9izonF6NaheUnxYmKMdM3hMpWfFj+EigCzLyZaBJsSRDbFqLZtgIRzfucqEQol4ZsZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:43:22.548647Z"},"content_sha256":"42fd43a9589955f523908ad100b593118280de62e88918b561e2de4acf2b73ab","schema_version":"1.0","event_id":"sha256:42fd43a9589955f523908ad100b593118280de62e88918b561e2de4acf2b73ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/bundle.json","state_url":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/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-02T21:43:22Z","links":{"resolver":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM","bundle":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/bundle.json","state":"https://pith.science/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2S74ZV3LVWXNNVF4SPS5FJAWQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2S74ZV3LVWXNNVF4SPS5FJAWQM","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":"5559fa8b925740897394878663b546544b17b16bfd660694cc6d44a681888d31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-18T17:30:55Z","title_canon_sha256":"ac274cb4fac2d382456625b8664a6054124e536ae4b9ec487c3e15fea3fac1b7"},"schema_version":"1.0","source":{"id":"1610.05714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05714","created_at":"2026-05-18T01:01:58Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05714v1","created_at":"2026-05-18T01:01:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05714","created_at":"2026-05-18T01:01:58Z"},{"alias_kind":"pith_short_12","alias_value":"2S74ZV3LVWXN","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2S74ZV3LVWXNNVF4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2S74ZV3L","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:42fd43a9589955f523908ad100b593118280de62e88918b561e2de4acf2b73ab","target":"graph","created_at":"2026-05-18T01:01:58Z","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":"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.","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":"2016-10-18T17:30:55Z","title":"Minimizing the number of independent sets in triangle-free regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05714","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:09af717edd00548ef06592f0352014b653ff06a4c1ab049a71e96a2fa9677118","target":"record","created_at":"2026-05-18T01:01:58Z","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":"5559fa8b925740897394878663b546544b17b16bfd660694cc6d44a681888d31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-18T17:30:55Z","title_canon_sha256":"ac274cb4fac2d382456625b8664a6054124e536ae4b9ec487c3e15fea3fac1b7"},"schema_version":"1.0","source":{"id":"1610.05714","kind":"arxiv","version":1}},"canonical_sha256":"d4bfccd76badaed6d4bc93e5d2a41683348592925e37408b1f0763974f38f63b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4bfccd76badaed6d4bc93e5d2a41683348592925e37408b1f0763974f38f63b","first_computed_at":"2026-05-18T01:01:58.553585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:58.553585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CDlfVNCI8i8HiyyqSuBPiIJFkVB/OR01lP5ZTNA8+RyhYAQ5w1KUs+VgvDRCbaZ91/YweyfizgRHbCpsByazCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:58.554349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09af717edd00548ef06592f0352014b653ff06a4c1ab049a71e96a2fa9677118","sha256:42fd43a9589955f523908ad100b593118280de62e88918b561e2de4acf2b73ab"],"state_sha256":"3379bddd592da5ef218bc7e08c4f15bbd47ff1c46afd40c52556cf6991f153bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K3nT+iTlnkPGddGA/JCSXmq+Wk3DzSQWm6DVqIfbApvMBLqo/CqDqBqQ93cKBMYmayp2ph16MSwGrN5y2mFoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:43:22.550567Z","bundle_sha256":"ddba413b26b94d9e6a6b4244a6a191a018b39fa50144a18bb585f35e6778f686"}}