{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WCV7WJHPFXFOKU72SNIJKRQ42D","short_pith_number":"pith:WCV7WJHP","schema_version":"1.0","canonical_sha256":"b0abfb24ef2dcae553fa935095461cd0d061be3fc2771d6d13dd0d08444c9f22","source":{"kind":"arxiv","id":"1306.2053","version":2},"attestation_state":"computed","paper":{"title":"Happy Edges: Threshold-Coloring of Regular Lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakson Toeniskoetter, Md. Jawaherul Alam, Sergey Pupyrev, Stephen G. Kobourov","submitted_at":"2013-06-09T19:23:58Z","abstract_excerpt":"We study a graph coloring problem motivated by a fun Sudoku-style puzzle. Given a bipartition of the edges of a graph into {\\em near} and {\\em far} sets and an integer threshold $t$, a {\\em threshold-coloring} of the graph is an assignment of integers to the vertices so that endpoints of near edges differ by $t$ or less, while endpoints of far edges differ by more than $t$. We study threshold-coloring of tilings of the plane by regular polygons, known as Archimedean lattices, and their duals, the Laves lattices. We prove that some are threshold-colorable with constant number of colors for any "},"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.2053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-09T19:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"7ecab12123373f8dd721703dbeeb24614929d0e8481bce9e72e7876c909cd402","abstract_canon_sha256":"fc8bafe99804a1f7e68f3f16bd1740f04006ca331ff3654c137ff1117a942a17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:59.908909Z","signature_b64":"E75xa2x5hUHfbvKHfPZPDwsuMp0bunmVtH07vcNg/n93HYPRo0rnwijLjW00HimJYOQ1i/R64OGmk+dsLxGXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0abfb24ef2dcae553fa935095461cd0d061be3fc2771d6d13dd0d08444c9f22","last_reissued_at":"2026-05-18T02:56:59.908473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:59.908473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Happy Edges: Threshold-Coloring of Regular Lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakson Toeniskoetter, Md. Jawaherul Alam, Sergey Pupyrev, Stephen G. Kobourov","submitted_at":"2013-06-09T19:23:58Z","abstract_excerpt":"We study a graph coloring problem motivated by a fun Sudoku-style puzzle. Given a bipartition of the edges of a graph into {\\em near} and {\\em far} sets and an integer threshold $t$, a {\\em threshold-coloring} of the graph is an assignment of integers to the vertices so that endpoints of near edges differ by $t$ or less, while endpoints of far edges differ by more than $t$. We study threshold-coloring of tilings of the plane by regular polygons, known as Archimedean lattices, and their duals, the Laves lattices. We prove that some are threshold-colorable with constant number of colors for any "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2053","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.2053","created_at":"2026-05-18T02:56:59.908537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2053v2","created_at":"2026-05-18T02:56:59.908537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2053","created_at":"2026-05-18T02:56:59.908537+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCV7WJHPFXFO","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCV7WJHPFXFOKU72","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCV7WJHP","created_at":"2026-05-18T12:28:04.890932+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/WCV7WJHPFXFOKU72SNIJKRQ42D","json":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D.json","graph_json":"https://pith.science/api/pith-number/WCV7WJHPFXFOKU72SNIJKRQ42D/graph.json","events_json":"https://pith.science/api/pith-number/WCV7WJHPFXFOKU72SNIJKRQ42D/events.json","paper":"https://pith.science/paper/WCV7WJHP"},"agent_actions":{"view_html":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D","download_json":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D.json","view_paper":"https://pith.science/paper/WCV7WJHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2053&json=true","fetch_graph":"https://pith.science/api/pith-number/WCV7WJHPFXFOKU72SNIJKRQ42D/graph.json","fetch_events":"https://pith.science/api/pith-number/WCV7WJHPFXFOKU72SNIJKRQ42D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/action/storage_attestation","attest_author":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/action/author_attestation","sign_citation":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/action/citation_signature","submit_replication":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/action/replication_record"}},"created_at":"2026-05-18T02:56:59.908537+00:00","updated_at":"2026-05-18T02:56:59.908537+00:00"}