{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MEF7KVYYKXD4NXZ23FCKAL3XFY","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":"0742d655f0ce026f8b0a309a1ad9e2a0a61b43164c4cfa6216256b008034b0c4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-09-08T16:05:22Z","title_canon_sha256":"8f665e591e171ae840265943fbf1cf98e9555d07a16b2a27356f81cf4ff96264"},"schema_version":"1.0","source":{"id":"2109.03744","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.03744","created_at":"2026-07-05T03:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"2109.03744v1","created_at":"2026-07-05T03:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.03744","created_at":"2026-07-05T03:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"MEF7KVYYKXD4","created_at":"2026-07-05T03:12:42Z"},{"alias_kind":"pith_short_16","alias_value":"MEF7KVYYKXD4NXZ2","created_at":"2026-07-05T03:12:42Z"},{"alias_kind":"pith_short_8","alias_value":"MEF7KVYY","created_at":"2026-07-05T03:12:42Z"}],"graph_snapshots":[{"event_id":"sha256:95be71c771f18f90c8778236a09bd0d8c8d6d3cf6acb22cec169310e0a142e22","target":"graph","created_at":"2026-07-05T03:12:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.03744/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aditya Potukuchi, Matthew Jenssen, Will Perkins","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-09-08T16:05:22Z","title":"Approximately counting independent sets in bipartite graphs via graph containers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.03744","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:d3b8addc67be561d6f732b2e2a58a6b2c703ea660799456f71307149367497c3","target":"record","created_at":"2026-07-05T03:12:42Z","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":"0742d655f0ce026f8b0a309a1ad9e2a0a61b43164c4cfa6216256b008034b0c4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-09-08T16:05:22Z","title_canon_sha256":"8f665e591e171ae840265943fbf1cf98e9555d07a16b2a27356f81cf4ff96264"},"schema_version":"1.0","source":{"id":"2109.03744","kind":"arxiv","version":1}},"canonical_sha256":"610bf5571855c7c6df3ad944a02f772e31bfe653fc604366acd28590a0ba395d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"610bf5571855c7c6df3ad944a02f772e31bfe653fc604366acd28590a0ba395d","first_computed_at":"2026-07-05T03:12:42.670390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:12:42.670390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eLCDAzbscdiw1g4pI84G/OotUVK19l37ELqVoZcG+F/Dmm3iAaXX7BiM6/PPeAPg5xx1UShJwwQDuDEvlfM+Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:12:42.670732Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.03744","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3b8addc67be561d6f732b2e2a58a6b2c703ea660799456f71307149367497c3","sha256:95be71c771f18f90c8778236a09bd0d8c8d6d3cf6acb22cec169310e0a142e22"],"state_sha256":"d4f84192c546a725cce7b097246902d8756594a9325bdda730d2f6895feaba22"}