{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QXL5PA2JRA3YY5RTDDOHHXOGKK","short_pith_number":"pith:QXL5PA2J","schema_version":"1.0","canonical_sha256":"85d7d7834988378c763318dc73ddc65289442a5bfee068940d5b26d69d64077c","source":{"kind":"arxiv","id":"1402.0949","version":1},"attestation_state":"computed","paper":{"title":"A short proof of Kotzig's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gleb Nenashev","submitted_at":"2014-02-05T06:54:01Z","abstract_excerpt":"A new shortest proof of Kotzig's Theorem about graphs with unique perfect matching is presented in this paper. It is well known that Kotzig's theorem is a consequence of Yeo's Theorem about edge-colored graph without alternating cycle. We present a proof of Yeo's Theorem based on the same ideas as our proof of Kotzig's theorem."},"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":"1402.0949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-05T06:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"6ac25bee6395c37fbf90c1f9c21daa778704a6eec6723aa7309461c6b21d08c8","abstract_canon_sha256":"13d62d54402100c6b5decfcc1b85b7ee1fff7f31a0eed8e1ae65af2f8656a42d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:02.214573Z","signature_b64":"GY+G6xFAxCAuPMBpaZ5x6dnv3Tghux1I+hUaRyPBirG57d/EL58ttBRyFlOG/LrUUve2CJddNVxko0yfN08zDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d7d7834988378c763318dc73ddc65289442a5bfee068940d5b26d69d64077c","last_reissued_at":"2026-05-18T03:00:02.214023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:02.214023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short proof of Kotzig's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gleb Nenashev","submitted_at":"2014-02-05T06:54:01Z","abstract_excerpt":"A new shortest proof of Kotzig's Theorem about graphs with unique perfect matching is presented in this paper. It is well known that Kotzig's theorem is a consequence of Yeo's Theorem about edge-colored graph without alternating cycle. We present a proof of Yeo's Theorem based on the same ideas as our proof of Kotzig's theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0949","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":"1402.0949","created_at":"2026-05-18T03:00:02.214101+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0949v1","created_at":"2026-05-18T03:00:02.214101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0949","created_at":"2026-05-18T03:00:02.214101+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXL5PA2JRA3Y","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXL5PA2JRA3YY5RT","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXL5PA2J","created_at":"2026-05-18T12:28:46.137349+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/QXL5PA2JRA3YY5RTDDOHHXOGKK","json":"https://pith.science/pith/QXL5PA2JRA3YY5RTDDOHHXOGKK.json","graph_json":"https://pith.science/api/pith-number/QXL5PA2JRA3YY5RTDDOHHXOGKK/graph.json","events_json":"https://pith.science/api/pith-number/QXL5PA2JRA3YY5RTDDOHHXOGKK/events.json","paper":"https://pith.science/paper/QXL5PA2J"},"agent_actions":{"view_html":"https://pith.science/pith/QXL5PA2JRA3YY5RTDDOHHXOGKK","download_json":"https://pith.science/pith/QXL5PA2JRA3YY5RTDDOHHXOGKK.json","view_paper":"https://pith.science/paper/QXL5PA2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0949&json=true","fetch_graph":"https://pith.science/api/pith-number/QXL5PA2JRA3YY5RTDDOHHXOGKK/graph.json","fetch_events":"https://pith.science/api/pith-number/QXL5PA2JRA3YY5RTDDOHHXOGKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXL5PA2JRA3YY5RTDDOHHXOGKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXL5PA2JRA3YY5RTDDOHHXOGKK/action/storage_attestation","attest_author":"https://pith.science/pith/QXL5PA2JRA3YY5RTDDOHHXOGKK/action/author_attestation","sign_citation":"https://pith.science/pith/QXL5PA2JRA3YY5RTDDOHHXOGKK/action/citation_signature","submit_replication":"https://pith.science/pith/QXL5PA2JRA3YY5RTDDOHHXOGKK/action/replication_record"}},"created_at":"2026-05-18T03:00:02.214101+00:00","updated_at":"2026-05-18T03:00:02.214101+00:00"}