{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RMXKHKH5XHTMTZ7UNNNUO3JQOU","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":"bdc0c813c9c5e0ea0068324bd094dec0078e0fbf7be598c9d6b7155306ddf78e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-03T17:05:02Z","title_canon_sha256":"9fbcd134dd4a8e381173162f22ba41bc9af4d959c3a670d941d62cea42345711"},"schema_version":"1.0","source":{"id":"2608.02503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.02503","created_at":"2026-08-04T02:43:50Z"},{"alias_kind":"arxiv_version","alias_value":"2608.02503v1","created_at":"2026-08-04T02:43:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02503","created_at":"2026-08-04T02:43:50Z"},{"alias_kind":"pith_short_12","alias_value":"RMXKHKH5XHTM","created_at":"2026-08-04T02:43:50Z"},{"alias_kind":"pith_short_16","alias_value":"RMXKHKH5XHTMTZ7U","created_at":"2026-08-04T02:43:50Z"},{"alias_kind":"pith_short_8","alias_value":"RMXKHKH5","created_at":"2026-08-04T02:43:50Z"}],"graph_snapshots":[{"event_id":"sha256:bbc7604fb451e22a40e97dcd7520b2ead8940cc07ba1950ff78d02a04576a5aa","target":"graph","created_at":"2026-08-04T02:43:50Z","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/2608.02503/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by recent work of Kocurek, Oveis Gharan, and Tjowasi, which gives an efficient sampling algorithm for the hard-core model on random regular bipartite graphs by decomposing into fixed-size slices, we study the worst-case tractability of approximate counting and sampling of fixed-size slices for bipartite independent set problems. Let $G=(L\\sqcup R,E)$ be a bipartite graph with $|L|=|R|=n$ and maximum degree $\\Delta$. The fixed-slice problem asks to sample uniformly from independent sets satisfying $|I\\cap L|=\\alpha_L n$ and $|I\\cap R|=\\alpha_R n$. We show that if the overall density $","authors_text":"Ijay Narang, Timothy L. H. Wee, Will Perkins, Yuzhou Wang","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02503","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:12327eb04b69509d754eed144d3f6cb704de6705a7a6aedf5fde30f10eeb44ee","target":"record","created_at":"2026-08-04T02:43:50Z","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":"bdc0c813c9c5e0ea0068324bd094dec0078e0fbf7be598c9d6b7155306ddf78e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-03T17:05:02Z","title_canon_sha256":"9fbcd134dd4a8e381173162f22ba41bc9af4d959c3a670d941d62cea42345711"},"schema_version":"1.0","source":{"id":"2608.02503","kind":"arxiv","version":1}},"canonical_sha256":"8b2ea3a8fdb9e6c9e7f46b5b476d30751b9f154bf11f5a6449227faec8f42161","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b2ea3a8fdb9e6c9e7f46b5b476d30751b9f154bf11f5a6449227faec8f42161","first_computed_at":"2026-08-04T02:43:50.866166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T02:43:50.866166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oEp/ll8Eu1NS1z4dcl+6CohIUWlB8R4b8GJhW6j3sdOmmDfIT/dIiekEOXQvbgGh1tnVyxSEW8XvdawgnrniDQ==","signature_status":"signed_v1","signed_at":"2026-08-04T02:43:50.868629Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.02503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12327eb04b69509d754eed144d3f6cb704de6705a7a6aedf5fde30f10eeb44ee","sha256:bbc7604fb451e22a40e97dcd7520b2ead8940cc07ba1950ff78d02a04576a5aa"],"state_sha256":"09ad7b519a725384f4808c6e1b9647358462cafbfad91b4d3ca6b4ca9b539a89"}