{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MEF7KVYYKXD4NXZ23FCKAL3XFY","short_pith_number":"pith:MEF7KVYY","schema_version":"1.0","canonical_sha256":"610bf5571855c7c6df3ad944a02f772e31bfe653fc604366acd28590a0ba395d","source":{"kind":"arxiv","id":"2109.03744","version":1},"attestation_state":"computed","paper":{"title":"Approximately counting independent sets in bipartite graphs via graph containers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Aditya Potukuchi, Matthew Jenssen, Will Perkins","submitted_at":"2021-09-08T16:05:22Z","abstract_excerpt":"By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first algorithm applies to $d$-regular, bipartite graphs satisfying a weak expansion condition: when $d$ is constant, and the graph is a bipartite $\\Omega( \\log^2 d/d)$-expander, we obtain an FPTAS for the number of independent sets. Previously such a result for $d>5$ was known only for graphs satisfying the much stronger expansion conditions of random bipartite graphs. The algorithm also applies to weighted independent s"},"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":"2109.03744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-09-08T16:05:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8f665e591e171ae840265943fbf1cf98e9555d07a16b2a27356f81cf4ff96264","abstract_canon_sha256":"0742d655f0ce026f8b0a309a1ad9e2a0a61b43164c4cfa6216256b008034b0c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:12:42.670732Z","signature_b64":"eLCDAzbscdiw1g4pI84G/OotUVK19l37ELqVoZcG+F/Dmm3iAaXX7BiM6/PPeAPg5xx1UShJwwQDuDEvlfM+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"610bf5571855c7c6df3ad944a02f772e31bfe653fc604366acd28590a0ba395d","last_reissued_at":"2026-07-05T03:12:42.670390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:12:42.670390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximately counting independent sets in bipartite graphs via graph containers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Aditya Potukuchi, Matthew Jenssen, Will Perkins","submitted_at":"2021-09-08T16:05:22Z","abstract_excerpt":"By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first algorithm applies to $d$-regular, bipartite graphs satisfying a weak expansion condition: when $d$ is constant, and the graph is a bipartite $\\Omega( \\log^2 d/d)$-expander, we obtain an FPTAS for the number of independent sets. Previously such a result for $d>5$ was known only for graphs satisfying the much stronger expansion conditions of random bipartite graphs. The algorithm also applies to weighted independent s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.03744","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/2109.03744/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":"2109.03744","created_at":"2026-07-05T03:12:42.670452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.03744v1","created_at":"2026-07-05T03:12:42.670452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.03744","created_at":"2026-07-05T03:12:42.670452+00:00"},{"alias_kind":"pith_short_12","alias_value":"MEF7KVYYKXD4","created_at":"2026-07-05T03:12:42.670452+00:00"},{"alias_kind":"pith_short_16","alias_value":"MEF7KVYYKXD4NXZ2","created_at":"2026-07-05T03:12:42.670452+00:00"},{"alias_kind":"pith_short_8","alias_value":"MEF7KVYY","created_at":"2026-07-05T03:12:42.670452+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/MEF7KVYYKXD4NXZ23FCKAL3XFY","json":"https://pith.science/pith/MEF7KVYYKXD4NXZ23FCKAL3XFY.json","graph_json":"https://pith.science/api/pith-number/MEF7KVYYKXD4NXZ23FCKAL3XFY/graph.json","events_json":"https://pith.science/api/pith-number/MEF7KVYYKXD4NXZ23FCKAL3XFY/events.json","paper":"https://pith.science/paper/MEF7KVYY"},"agent_actions":{"view_html":"https://pith.science/pith/MEF7KVYYKXD4NXZ23FCKAL3XFY","download_json":"https://pith.science/pith/MEF7KVYYKXD4NXZ23FCKAL3XFY.json","view_paper":"https://pith.science/paper/MEF7KVYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.03744&json=true","fetch_graph":"https://pith.science/api/pith-number/MEF7KVYYKXD4NXZ23FCKAL3XFY/graph.json","fetch_events":"https://pith.science/api/pith-number/MEF7KVYYKXD4NXZ23FCKAL3XFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MEF7KVYYKXD4NXZ23FCKAL3XFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MEF7KVYYKXD4NXZ23FCKAL3XFY/action/storage_attestation","attest_author":"https://pith.science/pith/MEF7KVYYKXD4NXZ23FCKAL3XFY/action/author_attestation","sign_citation":"https://pith.science/pith/MEF7KVYYKXD4NXZ23FCKAL3XFY/action/citation_signature","submit_replication":"https://pith.science/pith/MEF7KVYYKXD4NXZ23FCKAL3XFY/action/replication_record"}},"created_at":"2026-07-05T03:12:42.670452+00:00","updated_at":"2026-07-05T03:12:42.670452+00:00"}