{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OCM3A3HN4NPJHV52GTOVMGL4HX","short_pith_number":"pith:OCM3A3HN","schema_version":"1.0","canonical_sha256":"7099b06cede35e93d7ba34dd56197c3dffcad3708b801475071a55a3a598742b","source":{"kind":"arxiv","id":"1712.01709","version":2},"attestation_state":"computed","paper":{"title":"Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Istv\\'an Mikl\\'os, P\\'eter L. Erd\\H{o}s, Tam\\'as R\\'obert Mezei","submitted_at":"2017-12-04T18:19:57Z","abstract_excerpt":"Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on graphic degree sequences. Several results were proved on rapidly mixing Markov chains on regular simple, on regular directed, on half-regular directed and on half-regular bipartite degree sequences. In this paper, the main result is the following: Let $U$ and $V$ be disjoint finite sets, and let $0 < c_1 \\le c_2 < |U|$ and $0 < d_1 \\le d_2 < |V|$ be integers. Furthermore, assume that the bipartite degree sequence on $U \\cup V$ satisfies $c_1 \\le d(v) \\le c_2\\ : \\ \\forall v\\in V$ and $d_1 \\le d(u)"},"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":"1712.01709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-04T18:19:57Z","cross_cats_sorted":[],"title_canon_sha256":"ff89a1569f94c34aeea9df9bc46ff020b82fb3b5f801f6fceabf4e1a72aaef91","abstract_canon_sha256":"6cd07dbd58cb09b02f09e1b24de8d2be1b642fc5be4103a02c1248668c70b2f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:24.317863Z","signature_b64":"yED5mEBkYN9OrhwxK2FAYw+g6+pFqwhkAsHt2akMNjaIuYlc8rb4l6Bg8duYdPsVGtoFfVzjAgwEELJYqg7hAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7099b06cede35e93d7ba34dd56197c3dffcad3708b801475071a55a3a598742b","last_reissued_at":"2026-07-05T00:17:24.317459Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:24.317459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Istv\\'an Mikl\\'os, P\\'eter L. Erd\\H{o}s, Tam\\'as R\\'obert Mezei","submitted_at":"2017-12-04T18:19:57Z","abstract_excerpt":"Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on graphic degree sequences. Several results were proved on rapidly mixing Markov chains on regular simple, on regular directed, on half-regular directed and on half-regular bipartite degree sequences. In this paper, the main result is the following: Let $U$ and $V$ be disjoint finite sets, and let $0 < c_1 \\le c_2 < |U|$ and $0 < d_1 \\le d_2 < |V|$ be integers. Furthermore, assume that the bipartite degree sequence on $U \\cup V$ satisfies $c_1 \\le d(v) \\le c_2\\ : \\ \\forall v\\in V$ and $d_1 \\le d(u)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01709","kind":"arxiv","version":2},"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/1712.01709/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":"1712.01709","created_at":"2026-07-05T00:17:24.317525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01709v2","created_at":"2026-07-05T00:17:24.317525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01709","created_at":"2026-07-05T00:17:24.317525+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCM3A3HN4NPJ","created_at":"2026-07-05T00:17:24.317525+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCM3A3HN4NPJHV52","created_at":"2026-07-05T00:17:24.317525+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCM3A3HN","created_at":"2026-07-05T00:17:24.317525+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/OCM3A3HN4NPJHV52GTOVMGL4HX","json":"https://pith.science/pith/OCM3A3HN4NPJHV52GTOVMGL4HX.json","graph_json":"https://pith.science/api/pith-number/OCM3A3HN4NPJHV52GTOVMGL4HX/graph.json","events_json":"https://pith.science/api/pith-number/OCM3A3HN4NPJHV52GTOVMGL4HX/events.json","paper":"https://pith.science/paper/OCM3A3HN"},"agent_actions":{"view_html":"https://pith.science/pith/OCM3A3HN4NPJHV52GTOVMGL4HX","download_json":"https://pith.science/pith/OCM3A3HN4NPJHV52GTOVMGL4HX.json","view_paper":"https://pith.science/paper/OCM3A3HN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01709&json=true","fetch_graph":"https://pith.science/api/pith-number/OCM3A3HN4NPJHV52GTOVMGL4HX/graph.json","fetch_events":"https://pith.science/api/pith-number/OCM3A3HN4NPJHV52GTOVMGL4HX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCM3A3HN4NPJHV52GTOVMGL4HX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCM3A3HN4NPJHV52GTOVMGL4HX/action/storage_attestation","attest_author":"https://pith.science/pith/OCM3A3HN4NPJHV52GTOVMGL4HX/action/author_attestation","sign_citation":"https://pith.science/pith/OCM3A3HN4NPJHV52GTOVMGL4HX/action/citation_signature","submit_replication":"https://pith.science/pith/OCM3A3HN4NPJHV52GTOVMGL4HX/action/replication_record"}},"created_at":"2026-07-05T00:17:24.317525+00:00","updated_at":"2026-07-05T00:17:24.317525+00:00"}