{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TMYUYSVJPCV6A3YEJ5KDUCBVND","short_pith_number":"pith:TMYUYSVJ","schema_version":"1.0","canonical_sha256":"9b314c4aa978abe06f044f543a083568e2c90b91e380a54ad286dba493f500a8","source":{"kind":"arxiv","id":"1609.09684","version":1},"attestation_state":"computed","paper":{"title":"Thoroughly Distributed Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Wayne Goddard","submitted_at":"2016-09-30T11:55:52Z","abstract_excerpt":"We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly distributed, that is, appears in every open neighborhood. Equivalently, every color is a total dominating set. We define $\\td(G)$ as the maximum number of colors in such a coloring and $\\FTD(G)$ as the fractional version thereof. In particular, we show that every claw-free graph with minimum degree at least~$2$ has~$\\FTD(G)\\ge 3/2$ and this is best possible. For planar graphs, we show that every triangular disc has $\\FTD(G) \\ge 3/2$ and this is best possible, and that every planar graph ha"},"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.09684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-30T11:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"6d879c7f75df0dc91dd89bd9393d674041e7d8805ef5ba0c00e722f79c8f5d41","abstract_canon_sha256":"4b97f11b8dbb6b73de4ca63b353e5d400253951c44f35e874336f3e6ad2a6e71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:33.659622Z","signature_b64":"XfDAdwIUinIe2IP1sUHoUafGu1kmpfwgc7c1w/X3ssA67mQZwoDdTH11uxYcjYlGvCLHj8K/uFZFrI5PxIP3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b314c4aa978abe06f044f543a083568e2c90b91e380a54ad286dba493f500a8","last_reissued_at":"2026-05-18T01:03:33.659049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:33.659049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thoroughly Distributed Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Wayne Goddard","submitted_at":"2016-09-30T11:55:52Z","abstract_excerpt":"We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly distributed, that is, appears in every open neighborhood. Equivalently, every color is a total dominating set. We define $\\td(G)$ as the maximum number of colors in such a coloring and $\\FTD(G)$ as the fractional version thereof. In particular, we show that every claw-free graph with minimum degree at least~$2$ has~$\\FTD(G)\\ge 3/2$ and this is best possible. For planar graphs, we show that every triangular disc has $\\FTD(G) \\ge 3/2$ and this is best possible, and that every planar graph ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09684","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":"1609.09684","created_at":"2026-05-18T01:03:33.659140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09684v1","created_at":"2026-05-18T01:03:33.659140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09684","created_at":"2026-05-18T01:03:33.659140+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMYUYSVJPCV6","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMYUYSVJPCV6A3YE","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMYUYSVJ","created_at":"2026-05-18T12:30:44.179134+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/TMYUYSVJPCV6A3YEJ5KDUCBVND","json":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND.json","graph_json":"https://pith.science/api/pith-number/TMYUYSVJPCV6A3YEJ5KDUCBVND/graph.json","events_json":"https://pith.science/api/pith-number/TMYUYSVJPCV6A3YEJ5KDUCBVND/events.json","paper":"https://pith.science/paper/TMYUYSVJ"},"agent_actions":{"view_html":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND","download_json":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND.json","view_paper":"https://pith.science/paper/TMYUYSVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09684&json=true","fetch_graph":"https://pith.science/api/pith-number/TMYUYSVJPCV6A3YEJ5KDUCBVND/graph.json","fetch_events":"https://pith.science/api/pith-number/TMYUYSVJPCV6A3YEJ5KDUCBVND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/action/storage_attestation","attest_author":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/action/author_attestation","sign_citation":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/action/citation_signature","submit_replication":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/action/replication_record"}},"created_at":"2026-05-18T01:03:33.659140+00:00","updated_at":"2026-05-18T01:03:33.659140+00:00"}