{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RMXKHKH5XHTMTZ7UNNNUO3JQOU","short_pith_number":"pith:RMXKHKH5","schema_version":"1.0","canonical_sha256":"8b2ea3a8fdb9e6c9e7f46b5b476d30751b9f154bf11f5a6449227faec8f42161","source":{"kind":"arxiv","id":"2608.02503","version":1},"attestation_state":"computed","paper":{"title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ijay Narang, Timothy L. H. Wee, Will Perkins, Yuzhou Wang","submitted_at":"2026-08-03T17:05:02Z","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 $"},"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":"2608.02503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-03T17:05:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9fbcd134dd4a8e381173162f22ba41bc9af4d959c3a670d941d62cea42345711","abstract_canon_sha256":"bdc0c813c9c5e0ea0068324bd094dec0078e0fbf7be598c9d6b7155306ddf78e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:43:50.868629Z","signature_b64":"oEp/ll8Eu1NS1z4dcl+6CohIUWlB8R4b8GJhW6j3sdOmmDfIT/dIiekEOXQvbgGh1tnVyxSEW8XvdawgnrniDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b2ea3a8fdb9e6c9e7f46b5b476d30751b9f154bf11f5a6449227faec8f42161","last_reissued_at":"2026-08-04T02:43:50.866166Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:43:50.866166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ijay Narang, Timothy L. H. Wee, Will Perkins, Yuzhou Wang","submitted_at":"2026-08-03T17:05:02Z","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 $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02503","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/2608.02503/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":"2608.02503","created_at":"2026-08-04T02:43:50.868645+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.02503v1","created_at":"2026-08-04T02:43:50.868645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02503","created_at":"2026-08-04T02:43:50.868645+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMXKHKH5XHTM","created_at":"2026-08-04T02:43:50.868645+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMXKHKH5XHTMTZ7U","created_at":"2026-08-04T02:43:50.868645+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMXKHKH5","created_at":"2026-08-04T02:43:50.868645+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03848","citing_title":"The Hard-Core Model on Bipartite Spectral Expanders: Counting and Sampling at All Fugacities","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMXKHKH5XHTMTZ7UNNNUO3JQOU","json":"https://pith.science/pith/RMXKHKH5XHTMTZ7UNNNUO3JQOU.json","graph_json":"https://pith.science/api/pith-number/RMXKHKH5XHTMTZ7UNNNUO3JQOU/graph.json","events_json":"https://pith.science/api/pith-number/RMXKHKH5XHTMTZ7UNNNUO3JQOU/events.json","paper":"https://pith.science/paper/RMXKHKH5"},"agent_actions":{"view_html":"https://pith.science/pith/RMXKHKH5XHTMTZ7UNNNUO3JQOU","download_json":"https://pith.science/pith/RMXKHKH5XHTMTZ7UNNNUO3JQOU.json","view_paper":"https://pith.science/paper/RMXKHKH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.02503&json=true","fetch_graph":"https://pith.science/api/pith-number/RMXKHKH5XHTMTZ7UNNNUO3JQOU/graph.json","fetch_events":"https://pith.science/api/pith-number/RMXKHKH5XHTMTZ7UNNNUO3JQOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMXKHKH5XHTMTZ7UNNNUO3JQOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMXKHKH5XHTMTZ7UNNNUO3JQOU/action/storage_attestation","attest_author":"https://pith.science/pith/RMXKHKH5XHTMTZ7UNNNUO3JQOU/action/author_attestation","sign_citation":"https://pith.science/pith/RMXKHKH5XHTMTZ7UNNNUO3JQOU/action/citation_signature","submit_replication":"https://pith.science/pith/RMXKHKH5XHTMTZ7UNNNUO3JQOU/action/replication_record"}},"created_at":"2026-08-04T02:43:50.868645+00:00","updated_at":"2026-08-04T02:43:50.868645+00:00"}