{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:AFWP4A5P6CGDWAARDIZAM533LA","short_pith_number":"pith:AFWP4A5P","schema_version":"1.0","canonical_sha256":"016cfe03aff08c3b00111a3206777b5826e3a9779cc988e823b8d89d1636cc08","source":{"kind":"arxiv","id":"1004.5230","version":4},"attestation_state":"computed","paper":{"title":"Extremal graphs for the identifying code problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aline Parreau (IF), Eleonora Guerrini (IF), Florent Foucaud (LaBRI), Matjaz Kovse (LaBRI), Petru Valicov (LaBRI), Reza Naserasr (LaBRI)","submitted_at":"2010-04-29T09:32:28Z","abstract_excerpt":"An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at most 1 from x. The problem of finding an identifying code of minimum possible size turned out to be a challenging problem. It was proved by N. Bertrand that if a graph on n vertices with at least one edge admits an identifying code, then a minimum identifying code has size at most n-1. Some classes of graphs whose smallest identifying code is of size n-1 were already known, and few conjectures were formulated to classi"},"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":"1004.5230","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-04-29T09:32:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a02cebde50174ea792ebabacf1268220e3d69d35c7406c775c12f936f92c5939","abstract_canon_sha256":"c3aecca753eb9228497bfc1c97010dd609397346094096b68f7c047c8eb54d8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:58.738150Z","signature_b64":"IzqWoaWUwdZpP0tAqmOvxBjZHlaQGFHwQ/D9MYkHLpffIdCy6BDdetx0fwzR6Bgeb5t+jMdQHLjUgRt6QwjrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"016cfe03aff08c3b00111a3206777b5826e3a9779cc988e823b8d89d1636cc08","last_reissued_at":"2026-05-18T04:27:58.737466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:58.737466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal graphs for the identifying code problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aline Parreau (IF), Eleonora Guerrini (IF), Florent Foucaud (LaBRI), Matjaz Kovse (LaBRI), Petru Valicov (LaBRI), Reza Naserasr (LaBRI)","submitted_at":"2010-04-29T09:32:28Z","abstract_excerpt":"An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at most 1 from x. The problem of finding an identifying code of minimum possible size turned out to be a challenging problem. It was proved by N. Bertrand that if a graph on n vertices with at least one edge admits an identifying code, then a minimum identifying code has size at most n-1. Some classes of graphs whose smallest identifying code is of size n-1 were already known, and few conjectures were formulated to classi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.5230","kind":"arxiv","version":4},"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":"1004.5230","created_at":"2026-05-18T04:27:58.737550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.5230v4","created_at":"2026-05-18T04:27:58.737550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.5230","created_at":"2026-05-18T04:27:58.737550+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFWP4A5P6CGD","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFWP4A5P6CGDWAAR","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFWP4A5P","created_at":"2026-05-18T12:26:05.355336+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/AFWP4A5P6CGDWAARDIZAM533LA","json":"https://pith.science/pith/AFWP4A5P6CGDWAARDIZAM533LA.json","graph_json":"https://pith.science/api/pith-number/AFWP4A5P6CGDWAARDIZAM533LA/graph.json","events_json":"https://pith.science/api/pith-number/AFWP4A5P6CGDWAARDIZAM533LA/events.json","paper":"https://pith.science/paper/AFWP4A5P"},"agent_actions":{"view_html":"https://pith.science/pith/AFWP4A5P6CGDWAARDIZAM533LA","download_json":"https://pith.science/pith/AFWP4A5P6CGDWAARDIZAM533LA.json","view_paper":"https://pith.science/paper/AFWP4A5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.5230&json=true","fetch_graph":"https://pith.science/api/pith-number/AFWP4A5P6CGDWAARDIZAM533LA/graph.json","fetch_events":"https://pith.science/api/pith-number/AFWP4A5P6CGDWAARDIZAM533LA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFWP4A5P6CGDWAARDIZAM533LA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFWP4A5P6CGDWAARDIZAM533LA/action/storage_attestation","attest_author":"https://pith.science/pith/AFWP4A5P6CGDWAARDIZAM533LA/action/author_attestation","sign_citation":"https://pith.science/pith/AFWP4A5P6CGDWAARDIZAM533LA/action/citation_signature","submit_replication":"https://pith.science/pith/AFWP4A5P6CGDWAARDIZAM533LA/action/replication_record"}},"created_at":"2026-05-18T04:27:58.737550+00:00","updated_at":"2026-05-18T04:27:58.737550+00:00"}