{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UKJONZCYPWFZA4KIBDXYOX46VP","short_pith_number":"pith:UKJONZCY","schema_version":"1.0","canonical_sha256":"a292e6e4587d8b90714808ef875f9eabdc3ce6e4208ee4b02a35297467fd7df9","source":{"kind":"arxiv","id":"1210.0635","version":1},"attestation_state":"computed","paper":{"title":"The t-tone chromatic number of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Andrzej Dudek, Deepak Bal, Patrick Bennett","submitted_at":"2012-10-02T02:38:41Z","abstract_excerpt":"A proper 2-tone $k$-coloring of a graph is a labeling of the vertices with elements from $\\binom{[k]}{2}$ such that adjacent vertices receive disjoint labels and vertices distance 2 apart receive distinct labels. The 2-tone chromatic number of a graph $G$, denoted $\\tau_2(G)$ is the smallest $k$ such that $G$ admits a proper 2-tone $k$ coloring. In this paper, we prove that w.h.p. for $p\\ge Cn^{-1/4}\\ln^{9/4}n$, $\\tau_2(G_{n,p})=(2+o(1))\\chi(G_{n,p})$ where $\\chi$ represents the ordinary chromatic number. For sparse random graphs with $p=c/n$, $c$ constant, we prove that $\\tau_2(G_{n,p}) = \\lc"},"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":"1210.0635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-02T02:38:41Z","cross_cats_sorted":[],"title_canon_sha256":"b1a4f57d04cefe2c6b19fb35c5fe485e726c7b72383641f755033b36b530ba7f","abstract_canon_sha256":"d2451183c849b19e9344feb440a33809a09e80b1e3a1a1e56759f1ae8468cf12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:14.653415Z","signature_b64":"WdEJUAAR2aMkrU3h1KxU+B/6GpPLubPcbo+5q5AENo6BQ5qdbGGeFUzl2WlKMk3f57MspnW5HjgivUfpUQrZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a292e6e4587d8b90714808ef875f9eabdc3ce6e4208ee4b02a35297467fd7df9","last_reissued_at":"2026-05-18T03:44:14.652752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:14.652752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The t-tone chromatic number of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Andrzej Dudek, Deepak Bal, Patrick Bennett","submitted_at":"2012-10-02T02:38:41Z","abstract_excerpt":"A proper 2-tone $k$-coloring of a graph is a labeling of the vertices with elements from $\\binom{[k]}{2}$ such that adjacent vertices receive disjoint labels and vertices distance 2 apart receive distinct labels. The 2-tone chromatic number of a graph $G$, denoted $\\tau_2(G)$ is the smallest $k$ such that $G$ admits a proper 2-tone $k$ coloring. In this paper, we prove that w.h.p. for $p\\ge Cn^{-1/4}\\ln^{9/4}n$, $\\tau_2(G_{n,p})=(2+o(1))\\chi(G_{n,p})$ where $\\chi$ represents the ordinary chromatic number. For sparse random graphs with $p=c/n$, $c$ constant, we prove that $\\tau_2(G_{n,p}) = \\lc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0635","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":"1210.0635","created_at":"2026-05-18T03:44:14.652857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0635v1","created_at":"2026-05-18T03:44:14.652857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0635","created_at":"2026-05-18T03:44:14.652857+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKJONZCYPWFZ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKJONZCYPWFZA4KI","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKJONZCY","created_at":"2026-05-18T12:27:23.164592+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/UKJONZCYPWFZA4KIBDXYOX46VP","json":"https://pith.science/pith/UKJONZCYPWFZA4KIBDXYOX46VP.json","graph_json":"https://pith.science/api/pith-number/UKJONZCYPWFZA4KIBDXYOX46VP/graph.json","events_json":"https://pith.science/api/pith-number/UKJONZCYPWFZA4KIBDXYOX46VP/events.json","paper":"https://pith.science/paper/UKJONZCY"},"agent_actions":{"view_html":"https://pith.science/pith/UKJONZCYPWFZA4KIBDXYOX46VP","download_json":"https://pith.science/pith/UKJONZCYPWFZA4KIBDXYOX46VP.json","view_paper":"https://pith.science/paper/UKJONZCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0635&json=true","fetch_graph":"https://pith.science/api/pith-number/UKJONZCYPWFZA4KIBDXYOX46VP/graph.json","fetch_events":"https://pith.science/api/pith-number/UKJONZCYPWFZA4KIBDXYOX46VP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKJONZCYPWFZA4KIBDXYOX46VP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKJONZCYPWFZA4KIBDXYOX46VP/action/storage_attestation","attest_author":"https://pith.science/pith/UKJONZCYPWFZA4KIBDXYOX46VP/action/author_attestation","sign_citation":"https://pith.science/pith/UKJONZCYPWFZA4KIBDXYOX46VP/action/citation_signature","submit_replication":"https://pith.science/pith/UKJONZCYPWFZA4KIBDXYOX46VP/action/replication_record"}},"created_at":"2026-05-18T03:44:14.652857+00:00","updated_at":"2026-05-18T03:44:14.652857+00:00"}