{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LPVXZ64FWRG7L6SNZVHYOOSLRE","short_pith_number":"pith:LPVXZ64F","schema_version":"1.0","canonical_sha256":"5beb7cfb85b44df5fa4dcd4f873a4b89141b5346d4c77a2067d1fadef58ab6e5","source":{"kind":"arxiv","id":"1609.00263","version":2},"attestation_state":"computed","paper":{"title":"On Robust Colorings of Hamming-Distance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Heide Gluesing-Luerssen, Isaiah Harney","submitted_at":"2016-09-01T15:04:07Z","abstract_excerpt":"$H_q(n,d)$ is defined as the graph with vertex set ${\\mathbb Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$. For the $4$-colorings of the graphs $H_2(n,n-1)$ a notion of robustness is introduced. It is based on the tolerance of swapping colors along an edge without destroying properness of the coloring. An explicit description of the maximally robust $4$-colorings of $H_2(n,n-1)$ is presented."},"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":"1609.00263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-01T15:04:07Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"title_canon_sha256":"e264d1328144fb9bed3f2c5c04d1629e8f091726a18d63449a297ca9b240c48f","abstract_canon_sha256":"c648b1c6f6865ed41af8d996e036fb7d3e87c116654d023fe06d495809fdc53c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:30.901633Z","signature_b64":"e9IDD9F3xxwab8odt0oVk9qV0caxhvAPlOmEu1aVq8lR8+VPV76yn4Prr3ps9jtcOrf+R+dtpL9kRrkZ+fRADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5beb7cfb85b44df5fa4dcd4f873a4b89141b5346d4c77a2067d1fadef58ab6e5","last_reissued_at":"2026-05-18T01:04:30.901074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:30.901074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Robust Colorings of Hamming-Distance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Heide Gluesing-Luerssen, Isaiah Harney","submitted_at":"2016-09-01T15:04:07Z","abstract_excerpt":"$H_q(n,d)$ is defined as the graph with vertex set ${\\mathbb Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$. For the $4$-colorings of the graphs $H_2(n,n-1)$ a notion of robustness is introduced. It is based on the tolerance of swapping colors along an edge without destroying properness of the coloring. An explicit description of the maximally robust $4$-colorings of $H_2(n,n-1)$ is presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00263","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":"1609.00263","created_at":"2026-05-18T01:04:30.901165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00263v2","created_at":"2026-05-18T01:04:30.901165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00263","created_at":"2026-05-18T01:04:30.901165+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPVXZ64FWRG7","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPVXZ64FWRG7L6SN","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPVXZ64F","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/LPVXZ64FWRG7L6SNZVHYOOSLRE","json":"https://pith.science/pith/LPVXZ64FWRG7L6SNZVHYOOSLRE.json","graph_json":"https://pith.science/api/pith-number/LPVXZ64FWRG7L6SNZVHYOOSLRE/graph.json","events_json":"https://pith.science/api/pith-number/LPVXZ64FWRG7L6SNZVHYOOSLRE/events.json","paper":"https://pith.science/paper/LPVXZ64F"},"agent_actions":{"view_html":"https://pith.science/pith/LPVXZ64FWRG7L6SNZVHYOOSLRE","download_json":"https://pith.science/pith/LPVXZ64FWRG7L6SNZVHYOOSLRE.json","view_paper":"https://pith.science/paper/LPVXZ64F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00263&json=true","fetch_graph":"https://pith.science/api/pith-number/LPVXZ64FWRG7L6SNZVHYOOSLRE/graph.json","fetch_events":"https://pith.science/api/pith-number/LPVXZ64FWRG7L6SNZVHYOOSLRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPVXZ64FWRG7L6SNZVHYOOSLRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPVXZ64FWRG7L6SNZVHYOOSLRE/action/storage_attestation","attest_author":"https://pith.science/pith/LPVXZ64FWRG7L6SNZVHYOOSLRE/action/author_attestation","sign_citation":"https://pith.science/pith/LPVXZ64FWRG7L6SNZVHYOOSLRE/action/citation_signature","submit_replication":"https://pith.science/pith/LPVXZ64FWRG7L6SNZVHYOOSLRE/action/replication_record"}},"created_at":"2026-05-18T01:04:30.901165+00:00","updated_at":"2026-05-18T01:04:30.901165+00:00"}