{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TMYUYSVJPCV6A3YEJ5KDUCBVND","short_pith_number":"pith:TMYUYSVJ","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"},"canonical_sha256":"9b314c4aa978abe06f044f543a083568e2c90b91e380a54ad286dba493f500a8","source":{"kind":"arxiv","id":"1609.09684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09684","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09684v1","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09684","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"TMYUYSVJPCV6","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TMYUYSVJPCV6A3YE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TMYUYSVJ","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TMYUYSVJPCV6A3YEJ5KDUCBVND","target":"record","payload":{"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"},"canonical_sha256":"9b314c4aa978abe06f044f543a083568e2c90b91e380a54ad286dba493f500a8","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"},"source_kind":"arxiv","source_id":"1609.09684","source_version":1,"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-18T01:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"udzc8HFDOK9KWg50/um+FLeQh5IBNRVJ+dQkDFkDx4hA3i/pth6LaD/Dx1NxwHIemlBNIMmJ8NNIJfuCL0/QCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:26:22.678629Z"},"content_sha256":"2459e8dba921971c398d6fb94151e3ec9476b0c388305ff9db3ceee073189c80","schema_version":"1.0","event_id":"sha256:2459e8dba921971c398d6fb94151e3ec9476b0c388305ff9db3ceee073189c80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TMYUYSVJPCV6A3YEJ5KDUCBVND","target":"graph","payload":{"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"},"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-18T01:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GrZFYe3OlTzxu9Ag6uFp+1ebRjBBGeXrd7tP4U4TAxw2X24UElb2Rd6tSgPAdP1yUplT5AbnpJBFc4pOoxa7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:26:22.678971Z"},"content_sha256":"78be59370cf006955b33294bef32c499c40ad190a3e3008ecce7a2b2fb2b6767","schema_version":"1.0","event_id":"sha256:78be59370cf006955b33294bef32c499c40ad190a3e3008ecce7a2b2fb2b6767"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/bundle.json","state_url":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/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-11T13:26:22Z","links":{"resolver":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND","bundle":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/bundle.json","state":"https://pith.science/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMYUYSVJPCV6A3YEJ5KDUCBVND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TMYUYSVJPCV6A3YEJ5KDUCBVND","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":"4b97f11b8dbb6b73de4ca63b353e5d400253951c44f35e874336f3e6ad2a6e71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-30T11:55:52Z","title_canon_sha256":"6d879c7f75df0dc91dd89bd9393d674041e7d8805ef5ba0c00e722f79c8f5d41"},"schema_version":"1.0","source":{"id":"1609.09684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09684","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09684v1","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09684","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"TMYUYSVJPCV6","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TMYUYSVJPCV6A3YE","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TMYUYSVJ","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:78be59370cf006955b33294bef32c499c40ad190a3e3008ecce7a2b2fb2b6767","target":"graph","created_at":"2026-05-18T01:03:33Z","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 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","authors_text":"Michael A. Henning, Wayne Goddard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-30T11:55:52Z","title":"Thoroughly Distributed Colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09684","kind":"arxiv","version":1},"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:2459e8dba921971c398d6fb94151e3ec9476b0c388305ff9db3ceee073189c80","target":"record","created_at":"2026-05-18T01:03:33Z","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":"4b97f11b8dbb6b73de4ca63b353e5d400253951c44f35e874336f3e6ad2a6e71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-30T11:55:52Z","title_canon_sha256":"6d879c7f75df0dc91dd89bd9393d674041e7d8805ef5ba0c00e722f79c8f5d41"},"schema_version":"1.0","source":{"id":"1609.09684","kind":"arxiv","version":1}},"canonical_sha256":"9b314c4aa978abe06f044f543a083568e2c90b91e380a54ad286dba493f500a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b314c4aa978abe06f044f543a083568e2c90b91e380a54ad286dba493f500a8","first_computed_at":"2026-05-18T01:03:33.659049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:33.659049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XfDAdwIUinIe2IP1sUHoUafGu1kmpfwgc7c1w/X3ssA67mQZwoDdTH11uxYcjYlGvCLHj8K/uFZFrI5PxIP3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:33.659622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2459e8dba921971c398d6fb94151e3ec9476b0c388305ff9db3ceee073189c80","sha256:78be59370cf006955b33294bef32c499c40ad190a3e3008ecce7a2b2fb2b6767"],"state_sha256":"c25928528d92a757c40757f73628cfceafe3f794cda71dc8264c25a8272ee37d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqNZ9zMYFsh7n8WMM6T+GjdXnbQ9ihxcA2FfsqlEvdQ9h3vNiSK7d5EiONKKbpcU+5vdPEpZO+awMrNgizedCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:26:22.680975Z","bundle_sha256":"4947bb86aac3742166aab36fec98a27a71b96bc2b008d2d75206e64b96c1749e"}}