{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:A3UML27HOMM4ECJVEXBUSTKMZG","short_pith_number":"pith:A3UML27H","schema_version":"1.0","canonical_sha256":"06e8c5ebe77319c2093525c3494d4cc986716dd4dddcba8787b01c3c8f6df11d","source":{"kind":"arxiv","id":"1306.6436","version":2},"attestation_state":"computed","paper":{"title":"Graph Derangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pete L. Clark","submitted_at":"2013-06-27T08:30:56Z","abstract_excerpt":"We introduce the notion of a graph derangement, which naturally interpolates between perfect matchings and Hamiltonian cycles. We give a necessary and sufficient condition for the existence of graph derangements on a locally finite graph. This result was first proved by W.T. Tutte in 1953 by applying some deeper results on digraphs. We give a new, simple proof which amounts to a reduction to the (Menger-Egervary-Konig-)Hall(-Hall) Theorem on transversals of set systems. Finally, we consider the problem of classifying all cycle types of graph derangements on m x n checkerboard graphs. Our prese"},"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":"1306.6436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-27T08:30:56Z","cross_cats_sorted":[],"title_canon_sha256":"3130bbf3b2e6e6a7fe90273d21bcc77c722b77ddf38a632f330e60c798458741","abstract_canon_sha256":"175f94766183d55d113a5d0de8bc5361d9396f73d63c55c821c4915171ebcca2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:23.208979Z","signature_b64":"NdSJeR06+jLB6hRCJ2UIRerR/sUdKXgiIH7ldbbKgjUGoRyU1p36fEPJOfJc/qbs7eoU60al7BAVyNIktXexBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06e8c5ebe77319c2093525c3494d4cc986716dd4dddcba8787b01c3c8f6df11d","last_reissued_at":"2026-05-18T03:19:23.208374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:23.208374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Derangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pete L. Clark","submitted_at":"2013-06-27T08:30:56Z","abstract_excerpt":"We introduce the notion of a graph derangement, which naturally interpolates between perfect matchings and Hamiltonian cycles. We give a necessary and sufficient condition for the existence of graph derangements on a locally finite graph. This result was first proved by W.T. Tutte in 1953 by applying some deeper results on digraphs. We give a new, simple proof which amounts to a reduction to the (Menger-Egervary-Konig-)Hall(-Hall) Theorem on transversals of set systems. Finally, we consider the problem of classifying all cycle types of graph derangements on m x n checkerboard graphs. Our prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6436","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":"1306.6436","created_at":"2026-05-18T03:19:23.208475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6436v2","created_at":"2026-05-18T03:19:23.208475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6436","created_at":"2026-05-18T03:19:23.208475+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3UML27HOMM4","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3UML27HOMM4ECJV","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3UML27H","created_at":"2026-05-18T12:27:38.830355+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/A3UML27HOMM4ECJVEXBUSTKMZG","json":"https://pith.science/pith/A3UML27HOMM4ECJVEXBUSTKMZG.json","graph_json":"https://pith.science/api/pith-number/A3UML27HOMM4ECJVEXBUSTKMZG/graph.json","events_json":"https://pith.science/api/pith-number/A3UML27HOMM4ECJVEXBUSTKMZG/events.json","paper":"https://pith.science/paper/A3UML27H"},"agent_actions":{"view_html":"https://pith.science/pith/A3UML27HOMM4ECJVEXBUSTKMZG","download_json":"https://pith.science/pith/A3UML27HOMM4ECJVEXBUSTKMZG.json","view_paper":"https://pith.science/paper/A3UML27H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6436&json=true","fetch_graph":"https://pith.science/api/pith-number/A3UML27HOMM4ECJVEXBUSTKMZG/graph.json","fetch_events":"https://pith.science/api/pith-number/A3UML27HOMM4ECJVEXBUSTKMZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3UML27HOMM4ECJVEXBUSTKMZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3UML27HOMM4ECJVEXBUSTKMZG/action/storage_attestation","attest_author":"https://pith.science/pith/A3UML27HOMM4ECJVEXBUSTKMZG/action/author_attestation","sign_citation":"https://pith.science/pith/A3UML27HOMM4ECJVEXBUSTKMZG/action/citation_signature","submit_replication":"https://pith.science/pith/A3UML27HOMM4ECJVEXBUSTKMZG/action/replication_record"}},"created_at":"2026-05-18T03:19:23.208475+00:00","updated_at":"2026-05-18T03:19:23.208475+00:00"}