{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ORKSJGWQHOAOITBQEYIZKW2PUO","short_pith_number":"pith:ORKSJGWQ","schema_version":"1.0","canonical_sha256":"7455249ad03b80e44c302611955b4fa38c4dd358a23431ff5d48ba619e25dea0","source":{"kind":"arxiv","id":"1004.2612","version":4},"attestation_state":"computed","paper":{"title":"Towards random uniform sampling of bipartite graphs with given degree sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ist\\'an Mikl\\'os, Lajos Soukup, P\\'eter L. Erd\\\"os","submitted_at":"2010-04-15T11:58:28Z","abstract_excerpt":"In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on $n$ vertices. We show that the mixing time of this Markov chain is bounded above by a polynomial in $n$ in case of {\\em semi-regular} degree sequence. The novelty of our approach lays in the construction of the canonical paths in Sinclair's method."},"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":"1004.2612","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-04-15T11:58:28Z","cross_cats_sorted":[],"title_canon_sha256":"a535643aa4a29a177dbc49a8dbe446d74193706bbfdfc389d0235d2f7d3321f7","abstract_canon_sha256":"1cd3892711760550eb6744e422532ed7af28594da8648c566f1e6b8400b18dc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:03:12.812386Z","signature_b64":"hbmtQcXuRgoOCSzRjRgjJMTkUcsKm5rIjRFoQUrzjsog05d6/c+J/BnD13o9ZQ/kqTRIsm8T1F61L7InetWMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7455249ad03b80e44c302611955b4fa38c4dd358a23431ff5d48ba619e25dea0","last_reissued_at":"2026-07-05T02:03:12.811967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:03:12.811967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards random uniform sampling of bipartite graphs with given degree sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ist\\'an Mikl\\'os, Lajos Soukup, P\\'eter L. Erd\\\"os","submitted_at":"2010-04-15T11:58:28Z","abstract_excerpt":"In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on $n$ vertices. We show that the mixing time of this Markov chain is bounded above by a polynomial in $n$ in case of {\\em semi-regular} degree sequence. The novelty of our approach lays in the construction of the canonical paths in Sinclair's method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2612","kind":"arxiv","version":4},"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/1004.2612/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":"1004.2612","created_at":"2026-07-05T02:03:12.812036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.2612v4","created_at":"2026-07-05T02:03:12.812036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2612","created_at":"2026-07-05T02:03:12.812036+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORKSJGWQHOAO","created_at":"2026-07-05T02:03:12.812036+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORKSJGWQHOAOITBQ","created_at":"2026-07-05T02:03:12.812036+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORKSJGWQ","created_at":"2026-07-05T02:03:12.812036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.19187","citing_title":"A scale invariant extension of the Georgi Machacek model","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ORKSJGWQHOAOITBQEYIZKW2PUO","json":"https://pith.science/pith/ORKSJGWQHOAOITBQEYIZKW2PUO.json","graph_json":"https://pith.science/api/pith-number/ORKSJGWQHOAOITBQEYIZKW2PUO/graph.json","events_json":"https://pith.science/api/pith-number/ORKSJGWQHOAOITBQEYIZKW2PUO/events.json","paper":"https://pith.science/paper/ORKSJGWQ"},"agent_actions":{"view_html":"https://pith.science/pith/ORKSJGWQHOAOITBQEYIZKW2PUO","download_json":"https://pith.science/pith/ORKSJGWQHOAOITBQEYIZKW2PUO.json","view_paper":"https://pith.science/paper/ORKSJGWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.2612&json=true","fetch_graph":"https://pith.science/api/pith-number/ORKSJGWQHOAOITBQEYIZKW2PUO/graph.json","fetch_events":"https://pith.science/api/pith-number/ORKSJGWQHOAOITBQEYIZKW2PUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORKSJGWQHOAOITBQEYIZKW2PUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORKSJGWQHOAOITBQEYIZKW2PUO/action/storage_attestation","attest_author":"https://pith.science/pith/ORKSJGWQHOAOITBQEYIZKW2PUO/action/author_attestation","sign_citation":"https://pith.science/pith/ORKSJGWQHOAOITBQEYIZKW2PUO/action/citation_signature","submit_replication":"https://pith.science/pith/ORKSJGWQHOAOITBQEYIZKW2PUO/action/replication_record"}},"created_at":"2026-07-05T02:03:12.812036+00:00","updated_at":"2026-07-05T02:03:12.812036+00:00"}