{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3DUSD6OME6SKUA67SPXW3H3Y5N","short_pith_number":"pith:3DUSD6OM","schema_version":"1.0","canonical_sha256":"d8e921f9cc27a4aa03df93ef6d9f78eb56569dffd17b854da8614c2dbdc0d2e8","source":{"kind":"arxiv","id":"1106.5522","version":1},"attestation_state":"computed","paper":{"title":"Properties of Generalized Derangement Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hannah Jackson, Kathryn Nyman, Les Reid","submitted_at":"2011-06-27T20:44:32Z","abstract_excerpt":"A permutation sigma in Sn is a k-derangement if for any subset X = {a1, . . ., ak} \\subseteq [n], {sigma(a1), . . ., sigma(ak)} is not equal to X. One can form the k-derangement graph on the set of permutations of Sn by connecting two permutations sigma and tau if sigma(tau)^-1 is a k-derangement. We characterize when such a graph is connected or Eulerian. For n an odd prime power, we determine the independence, clique and chromatic number of the 2-derangement graph."},"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":"1106.5522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-27T20:44:32Z","cross_cats_sorted":[],"title_canon_sha256":"0d5014b4a18e4fe4a06cf6eda0065942c7f4e4698000f74c2443e7cce4ac722c","abstract_canon_sha256":"96c73440c8b382bf6dfff55b9f8a4116353d046a8fb78b8c63ffd385822edbe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:13.002434Z","signature_b64":"5tG/5cFUNcuDgDwCRxqYH+dSGKZJhNpfEBx5Ehyudt5abtuapM3mxIZEA/0ouhfHhANkHQKRYuQMMRBe5dKNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8e921f9cc27a4aa03df93ef6d9f78eb56569dffd17b854da8614c2dbdc0d2e8","last_reissued_at":"2026-05-18T04:19:13.001906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:13.001906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Properties of Generalized Derangement Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hannah Jackson, Kathryn Nyman, Les Reid","submitted_at":"2011-06-27T20:44:32Z","abstract_excerpt":"A permutation sigma in Sn is a k-derangement if for any subset X = {a1, . . ., ak} \\subseteq [n], {sigma(a1), . . ., sigma(ak)} is not equal to X. One can form the k-derangement graph on the set of permutations of Sn by connecting two permutations sigma and tau if sigma(tau)^-1 is a k-derangement. We characterize when such a graph is connected or Eulerian. For n an odd prime power, we determine the independence, clique and chromatic number of the 2-derangement graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5522","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":"1106.5522","created_at":"2026-05-18T04:19:13.001990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5522v1","created_at":"2026-05-18T04:19:13.001990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5522","created_at":"2026-05-18T04:19:13.001990+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DUSD6OME6SK","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DUSD6OME6SKUA67","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DUSD6OM","created_at":"2026-05-18T12:26:18.847500+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/3DUSD6OME6SKUA67SPXW3H3Y5N","json":"https://pith.science/pith/3DUSD6OME6SKUA67SPXW3H3Y5N.json","graph_json":"https://pith.science/api/pith-number/3DUSD6OME6SKUA67SPXW3H3Y5N/graph.json","events_json":"https://pith.science/api/pith-number/3DUSD6OME6SKUA67SPXW3H3Y5N/events.json","paper":"https://pith.science/paper/3DUSD6OM"},"agent_actions":{"view_html":"https://pith.science/pith/3DUSD6OME6SKUA67SPXW3H3Y5N","download_json":"https://pith.science/pith/3DUSD6OME6SKUA67SPXW3H3Y5N.json","view_paper":"https://pith.science/paper/3DUSD6OM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5522&json=true","fetch_graph":"https://pith.science/api/pith-number/3DUSD6OME6SKUA67SPXW3H3Y5N/graph.json","fetch_events":"https://pith.science/api/pith-number/3DUSD6OME6SKUA67SPXW3H3Y5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DUSD6OME6SKUA67SPXW3H3Y5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DUSD6OME6SKUA67SPXW3H3Y5N/action/storage_attestation","attest_author":"https://pith.science/pith/3DUSD6OME6SKUA67SPXW3H3Y5N/action/author_attestation","sign_citation":"https://pith.science/pith/3DUSD6OME6SKUA67SPXW3H3Y5N/action/citation_signature","submit_replication":"https://pith.science/pith/3DUSD6OME6SKUA67SPXW3H3Y5N/action/replication_record"}},"created_at":"2026-05-18T04:19:13.001990+00:00","updated_at":"2026-05-18T04:19:13.001990+00:00"}