{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:X6CJKS2KBORVBJ7KAVUZ3EQFPZ","short_pith_number":"pith:X6CJKS2K","schema_version":"1.0","canonical_sha256":"bf84954b4a0ba350a7ea05699d92057e66281e9f7dacb814e6bead5731a99b03","source":{"kind":"arxiv","id":"1203.6111","version":1},"attestation_state":"computed","paper":{"title":"Corrigendum: Sampling regular graphs and a peer-to-peer network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine Greenhill, Colin Cooper, Martin Dyer","submitted_at":"2012-03-27T23:27:35Z","abstract_excerpt":"In [Combinatorics, Probability and Computing 16 (2007), 557 - 593, Theorem 1] we proved a polynomial-time bound on the mixing rate of the switch chain for sampling d-regular graphs. This corrigendum corrects a technical error in the proof. In order to fix the error, we must multiply the bound on the mixing time by a factor of d^8 ."},"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":"1203.6111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-27T23:27:35Z","cross_cats_sorted":[],"title_canon_sha256":"33c2fff6f3a6a4e22598ee1647df5408fc3777f9c94e1a128078e12b5d8c1292","abstract_canon_sha256":"686d1d18b63496014989a9d0c95aae97b5d5799c239682ef8189a4d8e6574b84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:04.139185Z","signature_b64":"JPdxNgavDlcsL9leWHfva5H0srGY6F1iZlmJ3fQuQVOogPRAbAKZY7tgAuTj2lZhSDPyXcE86UHjKHYavqc/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf84954b4a0ba350a7ea05699d92057e66281e9f7dacb814e6bead5731a99b03","last_reissued_at":"2026-05-18T03:59:04.138508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:04.138508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Corrigendum: Sampling regular graphs and a peer-to-peer network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine Greenhill, Colin Cooper, Martin Dyer","submitted_at":"2012-03-27T23:27:35Z","abstract_excerpt":"In [Combinatorics, Probability and Computing 16 (2007), 557 - 593, Theorem 1] we proved a polynomial-time bound on the mixing rate of the switch chain for sampling d-regular graphs. This corrigendum corrects a technical error in the proof. In order to fix the error, we must multiply the bound on the mixing time by a factor of d^8 ."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6111","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":""},"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":"1203.6111","created_at":"2026-05-18T03:59:04.138609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.6111v1","created_at":"2026-05-18T03:59:04.138609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6111","created_at":"2026-05-18T03:59:04.138609+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6CJKS2KBORV","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6CJKS2KBORVBJ7K","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6CJKS2K","created_at":"2026-05-18T12:27:27.928770+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/X6CJKS2KBORVBJ7KAVUZ3EQFPZ","json":"https://pith.science/pith/X6CJKS2KBORVBJ7KAVUZ3EQFPZ.json","graph_json":"https://pith.science/api/pith-number/X6CJKS2KBORVBJ7KAVUZ3EQFPZ/graph.json","events_json":"https://pith.science/api/pith-number/X6CJKS2KBORVBJ7KAVUZ3EQFPZ/events.json","paper":"https://pith.science/paper/X6CJKS2K"},"agent_actions":{"view_html":"https://pith.science/pith/X6CJKS2KBORVBJ7KAVUZ3EQFPZ","download_json":"https://pith.science/pith/X6CJKS2KBORVBJ7KAVUZ3EQFPZ.json","view_paper":"https://pith.science/paper/X6CJKS2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.6111&json=true","fetch_graph":"https://pith.science/api/pith-number/X6CJKS2KBORVBJ7KAVUZ3EQFPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/X6CJKS2KBORVBJ7KAVUZ3EQFPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6CJKS2KBORVBJ7KAVUZ3EQFPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6CJKS2KBORVBJ7KAVUZ3EQFPZ/action/storage_attestation","attest_author":"https://pith.science/pith/X6CJKS2KBORVBJ7KAVUZ3EQFPZ/action/author_attestation","sign_citation":"https://pith.science/pith/X6CJKS2KBORVBJ7KAVUZ3EQFPZ/action/citation_signature","submit_replication":"https://pith.science/pith/X6CJKS2KBORVBJ7KAVUZ3EQFPZ/action/replication_record"}},"created_at":"2026-05-18T03:59:04.138609+00:00","updated_at":"2026-05-18T03:59:04.138609+00:00"}