{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KP3XFN74RTPBMXFECMRIYTWIBQ","short_pith_number":"pith:KP3XFN74","schema_version":"1.0","canonical_sha256":"53f772b7fc8cde165ca413228c4ec80c1d5232ec5c3e0c01997de6cc37c89048","source":{"kind":"arxiv","id":"1406.5936","version":2},"attestation_state":"computed","paper":{"title":"The Markov basis of $K_{3,N}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.AC","authors_text":"Johannes Rauh, Seth Sullivant","submitted_at":"2014-06-23T15:05:42Z","abstract_excerpt":"This document explains how to obtain a Markov basis of the graphical model of the complete bipartite graph $K_{3,N}$ with binary nodes. The computations illustrate the theory developed in arXiv:1404.6392 that explains how to compute Markov bases of toric fiber products."},"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":"1406.5936","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2014-06-23T15:05:42Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"e4997904384b81c9e312f5c17e5411db35e4c7d99f8e1e6a49aeca5698e321e2","abstract_canon_sha256":"b8f8724685eff853f823d860b79c194736994ba7790f8fdbe6111d9e6b6b8c52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:56.145553Z","signature_b64":"KljGxQzGY3f62RTy8l9+zDxiY8iGhuLGV9MctJuoycN2aiLiZ2gxepf7a4ujuf1f5sLIeifgyDcI0uEqVPKlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53f772b7fc8cde165ca413228c4ec80c1d5232ec5c3e0c01997de6cc37c89048","last_reissued_at":"2026-05-18T02:48:56.145019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:56.145019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Markov basis of $K_{3,N}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.AC","authors_text":"Johannes Rauh, Seth Sullivant","submitted_at":"2014-06-23T15:05:42Z","abstract_excerpt":"This document explains how to obtain a Markov basis of the graphical model of the complete bipartite graph $K_{3,N}$ with binary nodes. The computations illustrate the theory developed in arXiv:1404.6392 that explains how to compute Markov bases of toric fiber products."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5936","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":""},"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":"1406.5936","created_at":"2026-05-18T02:48:56.145103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5936v2","created_at":"2026-05-18T02:48:56.145103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5936","created_at":"2026-05-18T02:48:56.145103+00:00"},{"alias_kind":"pith_short_12","alias_value":"KP3XFN74RTPB","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KP3XFN74RTPBMXFE","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KP3XFN74","created_at":"2026-05-18T12:28:35.611951+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/KP3XFN74RTPBMXFECMRIYTWIBQ","json":"https://pith.science/pith/KP3XFN74RTPBMXFECMRIYTWIBQ.json","graph_json":"https://pith.science/api/pith-number/KP3XFN74RTPBMXFECMRIYTWIBQ/graph.json","events_json":"https://pith.science/api/pith-number/KP3XFN74RTPBMXFECMRIYTWIBQ/events.json","paper":"https://pith.science/paper/KP3XFN74"},"agent_actions":{"view_html":"https://pith.science/pith/KP3XFN74RTPBMXFECMRIYTWIBQ","download_json":"https://pith.science/pith/KP3XFN74RTPBMXFECMRIYTWIBQ.json","view_paper":"https://pith.science/paper/KP3XFN74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5936&json=true","fetch_graph":"https://pith.science/api/pith-number/KP3XFN74RTPBMXFECMRIYTWIBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/KP3XFN74RTPBMXFECMRIYTWIBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KP3XFN74RTPBMXFECMRIYTWIBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KP3XFN74RTPBMXFECMRIYTWIBQ/action/storage_attestation","attest_author":"https://pith.science/pith/KP3XFN74RTPBMXFECMRIYTWIBQ/action/author_attestation","sign_citation":"https://pith.science/pith/KP3XFN74RTPBMXFECMRIYTWIBQ/action/citation_signature","submit_replication":"https://pith.science/pith/KP3XFN74RTPBMXFECMRIYTWIBQ/action/replication_record"}},"created_at":"2026-05-18T02:48:56.145103+00:00","updated_at":"2026-05-18T02:48:56.145103+00:00"}