{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CEMGE73IXVQB2BXWHCER4C7SSX","short_pith_number":"pith:CEMGE73I","canonical_record":{"source":{"id":"1010.5624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-27T09:34:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a0348ac4bec034f74a048ca559ff2c2784c96c67d243cd48915e00883d134b16","abstract_canon_sha256":"8d5e373bcfc31add734e23f2fa59699b1d21b2d56b3397b824712e286d221967"},"schema_version":"1.0"},"canonical_sha256":"1118627f68bd601d06f638891e0bf295f2b8433e2b66f1625fd048628839960c","source":{"kind":"arxiv","id":"1010.5624","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5624","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5624v2","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5624","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"pith_short_12","alias_value":"CEMGE73IXVQB","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CEMGE73IXVQB2BXW","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CEMGE73I","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CEMGE73IXVQB2BXWHCER4C7SSX","target":"record","payload":{"canonical_record":{"source":{"id":"1010.5624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-27T09:34:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a0348ac4bec034f74a048ca559ff2c2784c96c67d243cd48915e00883d134b16","abstract_canon_sha256":"8d5e373bcfc31add734e23f2fa59699b1d21b2d56b3397b824712e286d221967"},"schema_version":"1.0"},"canonical_sha256":"1118627f68bd601d06f638891e0bf295f2b8433e2b66f1625fd048628839960c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:08.749084Z","signature_b64":"VpeGtHuqAV1ceyrUfjlmeFPbIzmzqrSjRBm2I2KO1XB1SHYk5Q7eoJ4tkUnWw66PZ3sErpkG0M/qYYqKkngdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1118627f68bd601d06f638891e0bf295f2b8433e2b66f1625fd048628839960c","last_reissued_at":"2026-05-18T01:32:08.748415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:08.748415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.5624","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-18T01:32:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+PeQ1T//OIgTq1Vya6MHuuBrRd2xHfZNHJ3EbETlx2ShXrp2RDaNSfJ2b8pSwHjOaf7OSyajOeHs7HrzCvNkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:01:47.841852Z"},"content_sha256":"91aab30f859815bfb70b44a0563c9e14d99791ef584dc58f269b421571e65058","schema_version":"1.0","event_id":"sha256:91aab30f859815bfb70b44a0563c9e14d99791ef584dc58f269b421571e65058"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CEMGE73IXVQB2BXWHCER4C7SSX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locally identifying coloring of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aline Parreau (IF), Louis Esperet (G-SCOP), Mickael Montassier (LaBRI), Pascal Ochem (LRI), Sylvain Gravier (IF)","submitted_at":"2010-10-27T09:34:56Z","abstract_excerpt":"We introduce the notion of locally identifying coloring of a graph. A proper vertex-coloring c of a graph G is said to be locally identifying, if for any adjacent vertices u and v with distinct closed neighborhood, the sets of colors that appear in the closed neighborhood of u and v are distinct. Let $\\chi_{lid}(G)$ be the minimum number of colors used in a locally identifying vertex-coloring of G. In this paper, we give several bounds on $\\chi_{lid}$ for different families of graphs (planar graphs, some subclasses of perfect graphs, graphs with bounded maximum degree) and prove that deciding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5624","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-18T01:32:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVBoY9P018oygwBHyJmWqbnp5AxFJqtdscTM2e/I6Wo6bxP2Q9lXouj5Q+wAl9RevVYPL1ZUbUwGjXM+/mhhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:01:47.842201Z"},"content_sha256":"559af52da3b9967a5bd69920f8dfcdd9adb764d31e9f2f24e9eb18c9d24ac4f2","schema_version":"1.0","event_id":"sha256:559af52da3b9967a5bd69920f8dfcdd9adb764d31e9f2f24e9eb18c9d24ac4f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEMGE73IXVQB2BXWHCER4C7SSX/bundle.json","state_url":"https://pith.science/pith/CEMGE73IXVQB2BXWHCER4C7SSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEMGE73IXVQB2BXWHCER4C7SSX/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-23T18:01:47Z","links":{"resolver":"https://pith.science/pith/CEMGE73IXVQB2BXWHCER4C7SSX","bundle":"https://pith.science/pith/CEMGE73IXVQB2BXWHCER4C7SSX/bundle.json","state":"https://pith.science/pith/CEMGE73IXVQB2BXWHCER4C7SSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEMGE73IXVQB2BXWHCER4C7SSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CEMGE73IXVQB2BXWHCER4C7SSX","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":"8d5e373bcfc31add734e23f2fa59699b1d21b2d56b3397b824712e286d221967","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-27T09:34:56Z","title_canon_sha256":"a0348ac4bec034f74a048ca559ff2c2784c96c67d243cd48915e00883d134b16"},"schema_version":"1.0","source":{"id":"1010.5624","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5624","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5624v2","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5624","created_at":"2026-05-18T01:32:08Z"},{"alias_kind":"pith_short_12","alias_value":"CEMGE73IXVQB","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CEMGE73IXVQB2BXW","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CEMGE73I","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:559af52da3b9967a5bd69920f8dfcdd9adb764d31e9f2f24e9eb18c9d24ac4f2","target":"graph","created_at":"2026-05-18T01:32:08Z","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 introduce the notion of locally identifying coloring of a graph. A proper vertex-coloring c of a graph G is said to be locally identifying, if for any adjacent vertices u and v with distinct closed neighborhood, the sets of colors that appear in the closed neighborhood of u and v are distinct. Let $\\chi_{lid}(G)$ be the minimum number of colors used in a locally identifying vertex-coloring of G. In this paper, we give several bounds on $\\chi_{lid}$ for different families of graphs (planar graphs, some subclasses of perfect graphs, graphs with bounded maximum degree) and prove that deciding ","authors_text":"Aline Parreau (IF), Louis Esperet (G-SCOP), Mickael Montassier (LaBRI), Pascal Ochem (LRI), Sylvain Gravier (IF)","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-27T09:34:56Z","title":"Locally identifying coloring of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5624","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:91aab30f859815bfb70b44a0563c9e14d99791ef584dc58f269b421571e65058","target":"record","created_at":"2026-05-18T01:32:08Z","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":"8d5e373bcfc31add734e23f2fa59699b1d21b2d56b3397b824712e286d221967","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-27T09:34:56Z","title_canon_sha256":"a0348ac4bec034f74a048ca559ff2c2784c96c67d243cd48915e00883d134b16"},"schema_version":"1.0","source":{"id":"1010.5624","kind":"arxiv","version":2}},"canonical_sha256":"1118627f68bd601d06f638891e0bf295f2b8433e2b66f1625fd048628839960c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1118627f68bd601d06f638891e0bf295f2b8433e2b66f1625fd048628839960c","first_computed_at":"2026-05-18T01:32:08.748415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:08.748415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VpeGtHuqAV1ceyrUfjlmeFPbIzmzqrSjRBm2I2KO1XB1SHYk5Q7eoJ4tkUnWw66PZ3sErpkG0M/qYYqKkngdDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:08.749084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5624","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91aab30f859815bfb70b44a0563c9e14d99791ef584dc58f269b421571e65058","sha256:559af52da3b9967a5bd69920f8dfcdd9adb764d31e9f2f24e9eb18c9d24ac4f2"],"state_sha256":"d69abb075753cb5870e14ae979e4efe6c2b1f44b33b91fd3576635c12b3a5a9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmCS6PnGDmv8Bz7gdcsRIV661qB5ZQlB82aEwc72ciz1v5NPZS7iC6uTxVBsq6k9PhZsXAjXFS084w7gzTV/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:01:47.844141Z","bundle_sha256":"2a4ed291ae33358337336cdb838753ebef77a4ae7fdba06f162cbb369ad38ecc"}}