{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WCV7WJHPFXFOKU72SNIJKRQ42D","short_pith_number":"pith:WCV7WJHP","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"},"canonical_sha256":"b0abfb24ef2dcae553fa935095461cd0d061be3fc2771d6d13dd0d08444c9f22","source":{"kind":"arxiv","id":"1306.2053","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2053","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2053v2","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2053","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"pith_short_12","alias_value":"WCV7WJHPFXFO","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WCV7WJHPFXFOKU72","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WCV7WJHP","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WCV7WJHPFXFOKU72SNIJKRQ42D","target":"record","payload":{"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"},"canonical_sha256":"b0abfb24ef2dcae553fa935095461cd0d061be3fc2771d6d13dd0d08444c9f22","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"},"source_kind":"arxiv","source_id":"1306.2053","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:56:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bv37Bk6W1ZksEwkq5jjFvcvoX/ewCsVfRhqzTsrl0u6HagDwpEYV/qIy1uiB0Bv2pt0DfD8kLBHszKKaNY4HCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:40:51.252801Z"},"content_sha256":"42c978d83c9a0ccd292b54addbe9078f1126c899b2454324abba3cb96150cb4a","schema_version":"1.0","event_id":"sha256:42c978d83c9a0ccd292b54addbe9078f1126c899b2454324abba3cb96150cb4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WCV7WJHPFXFOKU72SNIJKRQ42D","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:56:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijvrObqxptwBIcyT3veMrosBcuLmoxD2Bv1xmzM8qyNQJqct9nHbGPlAzWrRcCYJoWAlHRzYyEixl9sp3bvkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:40:51.253195Z"},"content_sha256":"c7b11a4c58bc83c1e7b5ac8b63e2489e06f236cc0d40c7bc732d66beba529501","schema_version":"1.0","event_id":"sha256:c7b11a4c58bc83c1e7b5ac8b63e2489e06f236cc0d40c7bc732d66beba529501"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/bundle.json","state_url":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T15:40:51Z","links":{"resolver":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D","bundle":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/bundle.json","state":"https://pith.science/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCV7WJHPFXFOKU72SNIJKRQ42D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WCV7WJHPFXFOKU72SNIJKRQ42D","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fc8bafe99804a1f7e68f3f16bd1740f04006ca331ff3654c137ff1117a942a17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-09T19:23:58Z","title_canon_sha256":"7ecab12123373f8dd721703dbeeb24614929d0e8481bce9e72e7876c909cd402"},"schema_version":"1.0","source":{"id":"1306.2053","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2053","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2053v2","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2053","created_at":"2026-05-18T02:56:59Z"},{"alias_kind":"pith_short_12","alias_value":"WCV7WJHPFXFO","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WCV7WJHPFXFOKU72","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WCV7WJHP","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:c7b11a4c58bc83c1e7b5ac8b63e2489e06f236cc0d40c7bc732d66beba529501","target":"graph","created_at":"2026-05-18T02:56:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Jakson Toeniskoetter, Md. Jawaherul Alam, Sergey Pupyrev, Stephen G. Kobourov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-09T19:23:58Z","title":"Happy Edges: Threshold-Coloring of Regular Lattices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2053","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:42c978d83c9a0ccd292b54addbe9078f1126c899b2454324abba3cb96150cb4a","target":"record","created_at":"2026-05-18T02:56:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fc8bafe99804a1f7e68f3f16bd1740f04006ca331ff3654c137ff1117a942a17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-09T19:23:58Z","title_canon_sha256":"7ecab12123373f8dd721703dbeeb24614929d0e8481bce9e72e7876c909cd402"},"schema_version":"1.0","source":{"id":"1306.2053","kind":"arxiv","version":2}},"canonical_sha256":"b0abfb24ef2dcae553fa935095461cd0d061be3fc2771d6d13dd0d08444c9f22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0abfb24ef2dcae553fa935095461cd0d061be3fc2771d6d13dd0d08444c9f22","first_computed_at":"2026-05-18T02:56:59.908473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:59.908473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E75xa2x5hUHfbvKHfPZPDwsuMp0bunmVtH07vcNg/n93HYPRo0rnwijLjW00HimJYOQ1i/R64OGmk+dsLxGXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:59.908909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2053","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42c978d83c9a0ccd292b54addbe9078f1126c899b2454324abba3cb96150cb4a","sha256:c7b11a4c58bc83c1e7b5ac8b63e2489e06f236cc0d40c7bc732d66beba529501"],"state_sha256":"2a47e1e55729518f5034493221f50fa8528abcdc3ebf6fa949f0caa824bd8cda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ftt7SO7K6WjQI/nk00IMP8aLH/CYJgdy3WuQM7u0y44dH/658Jii/EpEHaCc+RRPiuVhGES23Rnz93H6NjsyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:40:51.255073Z","bundle_sha256":"656cbf581f09d4a0d86b4218cf928e1fa2c44a7789fcd08b8b89306b0b0ba4ef"}}