{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:V3FJTUX5UVUH4RGTGOOHGRWUPI","short_pith_number":"pith:V3FJTUX5","schema_version":"1.0","canonical_sha256":"aeca99d2fda5687e44d3339c7346d47a0a15a40b5106065fa44d4bc4c95a845b","source":{"kind":"arxiv","id":"1304.1237","version":3},"attestation_state":"computed","paper":{"title":"Markov degree of the Birkhoff model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Akimichi Takemura, Mitsunori Ogawa, Takashi Yamaguchi","submitted_at":"2013-04-04T03:28:29Z","abstract_excerpt":"We prove the conjecture by Diaconis and Eriksson (2006) that the Markov degree of the Birkhoff model is three. In fact, we prove the conjecture in a generalization of the Birkhoff model, where each voter is asked to rank a fixed number, say r, of candidates among all candidates. We also give an exhaustive characterization of Markov bases for small r."},"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":"1304.1237","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-04-04T03:28:29Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"5acbdd237d714274388c91d56aa4eaf90ba146c8e73eccdd16884b02ece92685","abstract_canon_sha256":"86cf7dc340890b8f85716b39adddcc862f085ed7a0dc342bbda7509696a7ae55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:10.040811Z","signature_b64":"rgIJ/hvGHHVQE1Ts6zNzkZaLiQ1Tbk4doozKQMkWTU+2FvXKkS6GXQFQAxyXu5DatjJ5QfI4lisFvYJ3TnqMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeca99d2fda5687e44d3339c7346d47a0a15a40b5106065fa44d4bc4c95a845b","last_reissued_at":"2026-05-18T02:48:10.040382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:10.040382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov degree of the Birkhoff model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Akimichi Takemura, Mitsunori Ogawa, Takashi Yamaguchi","submitted_at":"2013-04-04T03:28:29Z","abstract_excerpt":"We prove the conjecture by Diaconis and Eriksson (2006) that the Markov degree of the Birkhoff model is three. In fact, we prove the conjecture in a generalization of the Birkhoff model, where each voter is asked to rank a fixed number, say r, of candidates among all candidates. We also give an exhaustive characterization of Markov bases for small r."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1237","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":""},"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":"1304.1237","created_at":"2026-05-18T02:48:10.040445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1237v3","created_at":"2026-05-18T02:48:10.040445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1237","created_at":"2026-05-18T02:48:10.040445+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3FJTUX5UVUH","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3FJTUX5UVUH4RGT","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3FJTUX5","created_at":"2026-05-18T12:28:02.375192+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/V3FJTUX5UVUH4RGTGOOHGRWUPI","json":"https://pith.science/pith/V3FJTUX5UVUH4RGTGOOHGRWUPI.json","graph_json":"https://pith.science/api/pith-number/V3FJTUX5UVUH4RGTGOOHGRWUPI/graph.json","events_json":"https://pith.science/api/pith-number/V3FJTUX5UVUH4RGTGOOHGRWUPI/events.json","paper":"https://pith.science/paper/V3FJTUX5"},"agent_actions":{"view_html":"https://pith.science/pith/V3FJTUX5UVUH4RGTGOOHGRWUPI","download_json":"https://pith.science/pith/V3FJTUX5UVUH4RGTGOOHGRWUPI.json","view_paper":"https://pith.science/paper/V3FJTUX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1237&json=true","fetch_graph":"https://pith.science/api/pith-number/V3FJTUX5UVUH4RGTGOOHGRWUPI/graph.json","fetch_events":"https://pith.science/api/pith-number/V3FJTUX5UVUH4RGTGOOHGRWUPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3FJTUX5UVUH4RGTGOOHGRWUPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3FJTUX5UVUH4RGTGOOHGRWUPI/action/storage_attestation","attest_author":"https://pith.science/pith/V3FJTUX5UVUH4RGTGOOHGRWUPI/action/author_attestation","sign_citation":"https://pith.science/pith/V3FJTUX5UVUH4RGTGOOHGRWUPI/action/citation_signature","submit_replication":"https://pith.science/pith/V3FJTUX5UVUH4RGTGOOHGRWUPI/action/replication_record"}},"created_at":"2026-05-18T02:48:10.040445+00:00","updated_at":"2026-05-18T02:48:10.040445+00:00"}