{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LIZVHNFSAG6FRHVYDQHVUI3RXC","short_pith_number":"pith:LIZVHNFS","schema_version":"1.0","canonical_sha256":"5a3353b4b201bc589eb81c0f5a2371b8b8e3b07e723ad87e35c4fd33d4f12102","source":{"kind":"arxiv","id":"1606.07918","version":1},"attestation_state":"computed","paper":{"title":"Properties, Proved and Conjectured, of Keller, Mycielski, and Queen Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Saltzman, Stan Wagon, Wendy Myrvold, Witold Jarnicki","submitted_at":"2016-06-25T14:39:43Z","abstract_excerpt":"We prove several results about three families of graphs. For queen graphs, defined from the usual moves of a chess queen, we find the edge-chromatic number in almost all cases. In the unproved case, we have a conjecture supported by a vast amount of computation, which involved the development of a new edge-coloring algorithm. The conjecture is that the edge-chromatic number is the maximum degree, except when simple arithmetic forces the edge-chromatic number to be one greater than the maximum degree. For Mycielski graphs, we strengthen an old result that the graphs are Hamiltonian by showing t"},"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":"1606.07918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-25T14:39:43Z","cross_cats_sorted":[],"title_canon_sha256":"bfb53cbe7fa121bd4cdbda0abedea6af8b9b1c6cdbb1d7eaa3171dbf100ae6df","abstract_canon_sha256":"4715c8ffcbf98243f13426ee56eaab501af0058422ffc1c76f7a83eb78e1e6da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:54.159250Z","signature_b64":"RkS0QjFQyMw0aFkVzGgyMShcolHZCyAY1imqyltyxfSWuKuMcSIuk+3Ft1Yygx3DDvnJUFESCDom0/8iNpo1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a3353b4b201bc589eb81c0f5a2371b8b8e3b07e723ad87e35c4fd33d4f12102","last_reissued_at":"2026-05-18T01:11:54.158909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:54.158909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Properties, Proved and Conjectured, of Keller, Mycielski, and Queen Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Saltzman, Stan Wagon, Wendy Myrvold, Witold Jarnicki","submitted_at":"2016-06-25T14:39:43Z","abstract_excerpt":"We prove several results about three families of graphs. For queen graphs, defined from the usual moves of a chess queen, we find the edge-chromatic number in almost all cases. In the unproved case, we have a conjecture supported by a vast amount of computation, which involved the development of a new edge-coloring algorithm. The conjecture is that the edge-chromatic number is the maximum degree, except when simple arithmetic forces the edge-chromatic number to be one greater than the maximum degree. For Mycielski graphs, we strengthen an old result that the graphs are Hamiltonian by showing t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07918","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":"1606.07918","created_at":"2026-05-18T01:11:54.158966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07918v1","created_at":"2026-05-18T01:11:54.158966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07918","created_at":"2026-05-18T01:11:54.158966+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIZVHNFSAG6F","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIZVHNFSAG6FRHVY","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIZVHNFS","created_at":"2026-05-18T12:30:29.479603+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/LIZVHNFSAG6FRHVYDQHVUI3RXC","json":"https://pith.science/pith/LIZVHNFSAG6FRHVYDQHVUI3RXC.json","graph_json":"https://pith.science/api/pith-number/LIZVHNFSAG6FRHVYDQHVUI3RXC/graph.json","events_json":"https://pith.science/api/pith-number/LIZVHNFSAG6FRHVYDQHVUI3RXC/events.json","paper":"https://pith.science/paper/LIZVHNFS"},"agent_actions":{"view_html":"https://pith.science/pith/LIZVHNFSAG6FRHVYDQHVUI3RXC","download_json":"https://pith.science/pith/LIZVHNFSAG6FRHVYDQHVUI3RXC.json","view_paper":"https://pith.science/paper/LIZVHNFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07918&json=true","fetch_graph":"https://pith.science/api/pith-number/LIZVHNFSAG6FRHVYDQHVUI3RXC/graph.json","fetch_events":"https://pith.science/api/pith-number/LIZVHNFSAG6FRHVYDQHVUI3RXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIZVHNFSAG6FRHVYDQHVUI3RXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIZVHNFSAG6FRHVYDQHVUI3RXC/action/storage_attestation","attest_author":"https://pith.science/pith/LIZVHNFSAG6FRHVYDQHVUI3RXC/action/author_attestation","sign_citation":"https://pith.science/pith/LIZVHNFSAG6FRHVYDQHVUI3RXC/action/citation_signature","submit_replication":"https://pith.science/pith/LIZVHNFSAG6FRHVYDQHVUI3RXC/action/replication_record"}},"created_at":"2026-05-18T01:11:54.158966+00:00","updated_at":"2026-05-18T01:11:54.158966+00:00"}