{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:T2FV5ZT5FWIHV37REKZ4PXOEDI","short_pith_number":"pith:T2FV5ZT5","schema_version":"1.0","canonical_sha256":"9e8b5ee67d2d907aeff122b3c7ddc41a219a1d80e2735e2f21a8d5adb744eb54","source":{"kind":"arxiv","id":"2606.22636","version":1},"attestation_state":"computed","paper":{"title":"Spectral Gap for the Binary Fixed-Margin Swap Chain","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO","stat.CO"],"primary_cat":"math.PR","authors_text":"Guanyang Wang, Qian Qin, Weibo Fu","submitted_at":"2026-06-21T18:46:59Z","abstract_excerpt":"We prove an inverse-polynomial spectral-gap bound for the lazy swap chain on binary matrices with prescribed row and column sums. This chain is a standard sampler for fixed-margin null models in ecology, statistics, and network analysis, and its rapid mixing for arbitrary feasible margins was conjectured by Kannan, Tetali, and Vempala in 1997. We show that for every feasible set of margins on an $m\\times n$ binary matrix, the lazy swap chain has spectral gap at least $$ \\binom{m}{2}^{-1}\\binom{n}{2}^{-1}, $$ which is tight in the worst case. The proof compares the swap chain with a two-row hea"},"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":"2606.22636","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2026-06-21T18:46:59Z","cross_cats_sorted":["cs.DS","math.CO","stat.CO"],"title_canon_sha256":"b7eb4d0fa023a04fec9d791e543879dd2bfd776825e3aa5e74a86c88fe954587","abstract_canon_sha256":"5da36210e5d4dc51e77e54420a5487ab38671c701e7c0a25720981e3412e3814"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:43.698634Z","signature_b64":"ccfFY2rT8AfvB/y9V0CxcLybTcBd1FQLrDJtZXnt0FHcN+IgjD5DdrpJQ9qBTThMTygg2JEENrQOSaA37l72CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e8b5ee67d2d907aeff122b3c7ddc41a219a1d80e2735e2f21a8d5adb744eb54","last_reissued_at":"2026-06-23T02:13:43.697453Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:43.697453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Gap for the Binary Fixed-Margin Swap Chain","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO","stat.CO"],"primary_cat":"math.PR","authors_text":"Guanyang Wang, Qian Qin, Weibo Fu","submitted_at":"2026-06-21T18:46:59Z","abstract_excerpt":"We prove an inverse-polynomial spectral-gap bound for the lazy swap chain on binary matrices with prescribed row and column sums. This chain is a standard sampler for fixed-margin null models in ecology, statistics, and network analysis, and its rapid mixing for arbitrary feasible margins was conjectured by Kannan, Tetali, and Vempala in 1997. We show that for every feasible set of margins on an $m\\times n$ binary matrix, the lazy swap chain has spectral gap at least $$ \\binom{m}{2}^{-1}\\binom{n}{2}^{-1}, $$ which is tight in the worst case. The proof compares the swap chain with a two-row hea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22636","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/2606.22636/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":"2606.22636","created_at":"2026-06-23T02:13:43.697515+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22636v1","created_at":"2026-06-23T02:13:43.697515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22636","created_at":"2026-06-23T02:13:43.697515+00:00"},{"alias_kind":"pith_short_12","alias_value":"T2FV5ZT5FWIH","created_at":"2026-06-23T02:13:43.697515+00:00"},{"alias_kind":"pith_short_16","alias_value":"T2FV5ZT5FWIHV37R","created_at":"2026-06-23T02:13:43.697515+00:00"},{"alias_kind":"pith_short_8","alias_value":"T2FV5ZT5","created_at":"2026-06-23T02:13:43.697515+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/T2FV5ZT5FWIHV37REKZ4PXOEDI","json":"https://pith.science/pith/T2FV5ZT5FWIHV37REKZ4PXOEDI.json","graph_json":"https://pith.science/api/pith-number/T2FV5ZT5FWIHV37REKZ4PXOEDI/graph.json","events_json":"https://pith.science/api/pith-number/T2FV5ZT5FWIHV37REKZ4PXOEDI/events.json","paper":"https://pith.science/paper/T2FV5ZT5"},"agent_actions":{"view_html":"https://pith.science/pith/T2FV5ZT5FWIHV37REKZ4PXOEDI","download_json":"https://pith.science/pith/T2FV5ZT5FWIHV37REKZ4PXOEDI.json","view_paper":"https://pith.science/paper/T2FV5ZT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22636&json=true","fetch_graph":"https://pith.science/api/pith-number/T2FV5ZT5FWIHV37REKZ4PXOEDI/graph.json","fetch_events":"https://pith.science/api/pith-number/T2FV5ZT5FWIHV37REKZ4PXOEDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T2FV5ZT5FWIHV37REKZ4PXOEDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T2FV5ZT5FWIHV37REKZ4PXOEDI/action/storage_attestation","attest_author":"https://pith.science/pith/T2FV5ZT5FWIHV37REKZ4PXOEDI/action/author_attestation","sign_citation":"https://pith.science/pith/T2FV5ZT5FWIHV37REKZ4PXOEDI/action/citation_signature","submit_replication":"https://pith.science/pith/T2FV5ZT5FWIHV37REKZ4PXOEDI/action/replication_record"}},"created_at":"2026-06-23T02:13:43.697515+00:00","updated_at":"2026-06-23T02:13:43.697515+00:00"}