{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MZJSVAHYM2DWULJ5KVUUTNIHHJ","short_pith_number":"pith:MZJSVAHY","schema_version":"1.0","canonical_sha256":"66532a80f866876a2d3d556949b5073a6d584437afd438cc26ac3353e44a1120","source":{"kind":"arxiv","id":"1807.04804","version":3},"attestation_state":"computed","paper":{"title":"Algorithms for #BIS-hard problems on expander graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.DS","authors_text":"Matthew Jenssen, Peter Keevash, Will Perkins","submitted_at":"2018-07-12T20:00:05Z","abstract_excerpt":"We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs and the low-temperature ferromagnetic Potts model on bounded-degree expander graphs. The results apply, for example, to random (bipartite) $\\Delta$-regular graphs, for which no efficient algorithms were known for these problems (with the exception of the Ising model) in the non-uniqueness regime of the infinite $\\Delta$-regular tree. We also find efficient counting and sampling algorithms for proper $q$-colorings of random $\\Delta$-regular bipartite graphs when"},"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":"1807.04804","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T20:00:05Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"e0d71630587a74e3b443560485ebeb8ab269b1d5899f96a5eaf7ea56e04c4d18","abstract_canon_sha256":"e6217bcff23cc56c2c3430063700926712c37d2a323787f4665ef3ae3859b462"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:00.193254Z","signature_b64":"cyAljATAGQPHE8sdCl89PJ0dlhXaNxxwFfXk33T78Jl1ptf8Cc5x8rh5XahzQkTsswoEk5n1vUW4dvGDrs97CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66532a80f866876a2d3d556949b5073a6d584437afd438cc26ac3353e44a1120","last_reissued_at":"2026-07-05T00:50:00.192846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:00.192846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for #BIS-hard problems on expander graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.DS","authors_text":"Matthew Jenssen, Peter Keevash, Will Perkins","submitted_at":"2018-07-12T20:00:05Z","abstract_excerpt":"We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs and the low-temperature ferromagnetic Potts model on bounded-degree expander graphs. The results apply, for example, to random (bipartite) $\\Delta$-regular graphs, for which no efficient algorithms were known for these problems (with the exception of the Ising model) in the non-uniqueness regime of the infinite $\\Delta$-regular tree. We also find efficient counting and sampling algorithms for proper $q$-colorings of random $\\Delta$-regular bipartite graphs when"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04804","kind":"arxiv","version":3},"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/1807.04804/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":"1807.04804","created_at":"2026-07-05T00:50:00.192902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04804v3","created_at":"2026-07-05T00:50:00.192902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04804","created_at":"2026-07-05T00:50:00.192902+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZJSVAHYM2DW","created_at":"2026-07-05T00:50:00.192902+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZJSVAHYM2DWULJ5","created_at":"2026-07-05T00:50:00.192902+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZJSVAHY","created_at":"2026-07-05T00:50:00.192902+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/MZJSVAHYM2DWULJ5KVUUTNIHHJ","json":"https://pith.science/pith/MZJSVAHYM2DWULJ5KVUUTNIHHJ.json","graph_json":"https://pith.science/api/pith-number/MZJSVAHYM2DWULJ5KVUUTNIHHJ/graph.json","events_json":"https://pith.science/api/pith-number/MZJSVAHYM2DWULJ5KVUUTNIHHJ/events.json","paper":"https://pith.science/paper/MZJSVAHY"},"agent_actions":{"view_html":"https://pith.science/pith/MZJSVAHYM2DWULJ5KVUUTNIHHJ","download_json":"https://pith.science/pith/MZJSVAHYM2DWULJ5KVUUTNIHHJ.json","view_paper":"https://pith.science/paper/MZJSVAHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04804&json=true","fetch_graph":"https://pith.science/api/pith-number/MZJSVAHYM2DWULJ5KVUUTNIHHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MZJSVAHYM2DWULJ5KVUUTNIHHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZJSVAHYM2DWULJ5KVUUTNIHHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZJSVAHYM2DWULJ5KVUUTNIHHJ/action/storage_attestation","attest_author":"https://pith.science/pith/MZJSVAHYM2DWULJ5KVUUTNIHHJ/action/author_attestation","sign_citation":"https://pith.science/pith/MZJSVAHYM2DWULJ5KVUUTNIHHJ/action/citation_signature","submit_replication":"https://pith.science/pith/MZJSVAHYM2DWULJ5KVUUTNIHHJ/action/replication_record"}},"created_at":"2026-07-05T00:50:00.192902+00:00","updated_at":"2026-07-05T00:50:00.192902+00:00"}