{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NF6OEMGT65JOONFBHRUHXPZRS4","short_pith_number":"pith:NF6OEMGT","schema_version":"1.0","canonical_sha256":"697ce230d3f752e734a13c687bbf319708089f87dfa2a0b5e73a19b0d693c5ec","source":{"kind":"arxiv","id":"2503.22255","version":1},"attestation_state":"computed","paper":{"title":"Counting independent sets in expanding bipartite regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anna Geisler, Joshua Erde, Maur\\'icio Collares, Mihyun Kang","submitted_at":"2025-03-28T09:12:45Z","abstract_excerpt":"In this paper we provide an asymptotic expansion for the number of independent sets in a general class of regular, bipartite graphs satisfying some vertex-expansion properties, extending results of Jenssen and Perkins on the hypercube and strengthening results of Jenssen, Perkins and Potukuchi. More precisely, we give an expansion of the independence polynomial of such graphs using a polymer model and the cluster expansion. In addition to the number of independent sets, our results yields information on the typical structure of (weighted) independent sets in such graphs. The class of graphs we"},"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":"2503.22255","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-28T09:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"0d3aeeaffb5447ee46e5ef25e89b7c8ec229c9d337295e54715c66378fc6575a","abstract_canon_sha256":"9523b7715392cba5f74cccd706d34ca1b33c8081cf3dc32964ffa16a89ab0e34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:40:50.155876Z","signature_b64":"SyoPuDunLnSK6O12YuYWlwVyVIettB2LipS4Xn6SMAIN0jfLVEaaMSbQPdicmkE99+PntiNkGTZejlDCWiODAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"697ce230d3f752e734a13c687bbf319708089f87dfa2a0b5e73a19b0d693c5ec","last_reissued_at":"2026-07-05T10:40:50.155247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:40:50.155247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting independent sets in expanding bipartite regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anna Geisler, Joshua Erde, Maur\\'icio Collares, Mihyun Kang","submitted_at":"2025-03-28T09:12:45Z","abstract_excerpt":"In this paper we provide an asymptotic expansion for the number of independent sets in a general class of regular, bipartite graphs satisfying some vertex-expansion properties, extending results of Jenssen and Perkins on the hypercube and strengthening results of Jenssen, Perkins and Potukuchi. More precisely, we give an expansion of the independence polynomial of such graphs using a polymer model and the cluster expansion. In addition to the number of independent sets, our results yields information on the typical structure of (weighted) independent sets in such graphs. The class of graphs we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.22255","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.22255/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.22255","created_at":"2026-07-05T10:40:50.155329+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.22255v1","created_at":"2026-07-05T10:40:50.155329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.22255","created_at":"2026-07-05T10:40:50.155329+00:00"},{"alias_kind":"pith_short_12","alias_value":"NF6OEMGT65JO","created_at":"2026-07-05T10:40:50.155329+00:00"},{"alias_kind":"pith_short_16","alias_value":"NF6OEMGT65JOONFB","created_at":"2026-07-05T10:40:50.155329+00:00"},{"alias_kind":"pith_short_8","alias_value":"NF6OEMGT","created_at":"2026-07-05T10:40:50.155329+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.08715","citing_title":"Counting independent sets in percolated graphs via the Ising model","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NF6OEMGT65JOONFBHRUHXPZRS4","json":"https://pith.science/pith/NF6OEMGT65JOONFBHRUHXPZRS4.json","graph_json":"https://pith.science/api/pith-number/NF6OEMGT65JOONFBHRUHXPZRS4/graph.json","events_json":"https://pith.science/api/pith-number/NF6OEMGT65JOONFBHRUHXPZRS4/events.json","paper":"https://pith.science/paper/NF6OEMGT"},"agent_actions":{"view_html":"https://pith.science/pith/NF6OEMGT65JOONFBHRUHXPZRS4","download_json":"https://pith.science/pith/NF6OEMGT65JOONFBHRUHXPZRS4.json","view_paper":"https://pith.science/paper/NF6OEMGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.22255&json=true","fetch_graph":"https://pith.science/api/pith-number/NF6OEMGT65JOONFBHRUHXPZRS4/graph.json","fetch_events":"https://pith.science/api/pith-number/NF6OEMGT65JOONFBHRUHXPZRS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NF6OEMGT65JOONFBHRUHXPZRS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NF6OEMGT65JOONFBHRUHXPZRS4/action/storage_attestation","attest_author":"https://pith.science/pith/NF6OEMGT65JOONFBHRUHXPZRS4/action/author_attestation","sign_citation":"https://pith.science/pith/NF6OEMGT65JOONFBHRUHXPZRS4/action/citation_signature","submit_replication":"https://pith.science/pith/NF6OEMGT65JOONFBHRUHXPZRS4/action/replication_record"}},"created_at":"2026-07-05T10:40:50.155329+00:00","updated_at":"2026-07-05T10:40:50.155329+00:00"}