{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:K6545ARDT3IM2WYIFOFSTAL5LZ","short_pith_number":"pith:K6545ARD","canonical_record":{"source":{"id":"1303.3191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-13T15:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"4a900bed77fd2fed390ba66324d442e1a154c99810c3b2a56f163d6a55a410e3","abstract_canon_sha256":"8657933e755305f7610c2082f918fbfa74a188287e17ed6d56b4d52db3eb6004"},"schema_version":"1.0"},"canonical_sha256":"57bbce82239ed0cd5b082b8b29817d5e59a3137cb1a72a6521010b51fbcd4890","source":{"kind":"arxiv","id":"1303.3191","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3191","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3191v2","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3191","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"K6545ARDT3IM","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K6545ARDT3IM2WYI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K6545ARD","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:K6545ARDT3IM2WYIFOFSTAL5LZ","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-13T15:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"4a900bed77fd2fed390ba66324d442e1a154c99810c3b2a56f163d6a55a410e3","abstract_canon_sha256":"8657933e755305f7610c2082f918fbfa74a188287e17ed6d56b4d52db3eb6004"},"schema_version":"1.0"},"canonical_sha256":"57bbce82239ed0cd5b082b8b29817d5e59a3137cb1a72a6521010b51fbcd4890","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:22.308626Z","signature_b64":"iT2GGyLsI39FwSRN+/sK+X6dR7J8ZO7sHac7YZrwEL15FbCKr8iUn99935qVjErg9KUCHWKXnVufZZa8m7CyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57bbce82239ed0cd5b082b8b29817d5e59a3137cb1a72a6521010b51fbcd4890","last_reissued_at":"2026-05-18T03:12:22.307969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:22.307969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3191","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-18T03:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+ITg6Q7ErkEKzKyp9lBF3dnECYs5UxaRwWKLcDsU9akUgX0jycQhqocFCb1AzrrberFlQU3MfqivvvGRWxABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:42:14.185711Z"},"content_sha256":"14ead02244310811852fbd6b9aaceb4403be696f470f7394a509670f93ac9d30","schema_version":"1.0","event_id":"sha256:14ead02244310811852fbd6b9aaceb4403be696f470f7394a509670f93ac9d30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:K6545ARDT3IM2WYIFOFSTAL5LZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance-two coloring of sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis Esperet, Zdenek Dvorak","submitted_at":"2013-03-13T15:30:23Z","abstract_excerpt":"Consider a graph $G = (V, E)$ and, for each vertex $v \\in V$, a subset $\\Sigma(v)$ of neighbors of $v$. A $\\Sigma$-coloring is a coloring of the elements of $V$ so that vertices appearing together in some $\\Sigma(v)$ receive pairwise distinct colors. An obvious lower bound for the minimum number of colors in such a coloring is the maximum size of a set $\\Sigma(v)$, denoted by $\\rho(\\Sigma)$. In this paper we study graph classes $F$ for which there is a function $f$, such that for any graph $G \\in F$ and any $\\Sigma$, there is a $\\Sigma$-coloring using at most $f(\\rho(\\Sigma))$ colors. It is pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3191","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-18T03:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IqBYD50CZgAMmG9SluF+zmVPg+pwxKNo9/ia8Qa/eUQyiZO8V3Sygtb6Qk3I+KeToH402L5tTyhEBkqPP0BACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:42:14.186424Z"},"content_sha256":"28a2d815741568d1318b4a9fda25d5949a2d327314acd21197d961523767aa88","schema_version":"1.0","event_id":"sha256:28a2d815741568d1318b4a9fda25d5949a2d327314acd21197d961523767aa88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/bundle.json","state_url":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/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-05-25T14:42:14Z","links":{"resolver":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ","bundle":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/bundle.json","state":"https://pith.science/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6545ARDT3IM2WYIFOFSTAL5LZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:K6545ARDT3IM2WYIFOFSTAL5LZ","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":"8657933e755305f7610c2082f918fbfa74a188287e17ed6d56b4d52db3eb6004","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-13T15:30:23Z","title_canon_sha256":"4a900bed77fd2fed390ba66324d442e1a154c99810c3b2a56f163d6a55a410e3"},"schema_version":"1.0","source":{"id":"1303.3191","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3191","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3191v2","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3191","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"K6545ARDT3IM","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K6545ARDT3IM2WYI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K6545ARD","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:28a2d815741568d1318b4a9fda25d5949a2d327314acd21197d961523767aa88","target":"graph","created_at":"2026-05-18T03:12:22Z","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":"Consider a graph $G = (V, E)$ and, for each vertex $v \\in V$, a subset $\\Sigma(v)$ of neighbors of $v$. A $\\Sigma$-coloring is a coloring of the elements of $V$ so that vertices appearing together in some $\\Sigma(v)$ receive pairwise distinct colors. An obvious lower bound for the minimum number of colors in such a coloring is the maximum size of a set $\\Sigma(v)$, denoted by $\\rho(\\Sigma)$. In this paper we study graph classes $F$ for which there is a function $f$, such that for any graph $G \\in F$ and any $\\Sigma$, there is a $\\Sigma$-coloring using at most $f(\\rho(\\Sigma))$ colors. It is pr","authors_text":"Louis Esperet, Zdenek Dvorak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-13T15:30:23Z","title":"Distance-two coloring of sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3191","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:14ead02244310811852fbd6b9aaceb4403be696f470f7394a509670f93ac9d30","target":"record","created_at":"2026-05-18T03:12:22Z","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":"8657933e755305f7610c2082f918fbfa74a188287e17ed6d56b4d52db3eb6004","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-13T15:30:23Z","title_canon_sha256":"4a900bed77fd2fed390ba66324d442e1a154c99810c3b2a56f163d6a55a410e3"},"schema_version":"1.0","source":{"id":"1303.3191","kind":"arxiv","version":2}},"canonical_sha256":"57bbce82239ed0cd5b082b8b29817d5e59a3137cb1a72a6521010b51fbcd4890","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57bbce82239ed0cd5b082b8b29817d5e59a3137cb1a72a6521010b51fbcd4890","first_computed_at":"2026-05-18T03:12:22.307969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:22.307969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iT2GGyLsI39FwSRN+/sK+X6dR7J8ZO7sHac7YZrwEL15FbCKr8iUn99935qVjErg9KUCHWKXnVufZZa8m7CyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:22.308626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3191","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14ead02244310811852fbd6b9aaceb4403be696f470f7394a509670f93ac9d30","sha256:28a2d815741568d1318b4a9fda25d5949a2d327314acd21197d961523767aa88"],"state_sha256":"1fd0dad785157485306aeb64df2e9cffb73263e5360e1e1347819bb449f2f38c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wo9LC+52zTgIbgKVl6OskMMJKtpM8MW1PMztcNGUs97HuQfyR/FlHwE1qI0D115OzzT6EQfQyme8NIzcZtubAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:42:14.189608Z","bundle_sha256":"644f2e739164cb737864c008d42efc97b789f732981857c4bc3e5a1c1f50617c"}}