{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DW6D3OIOFQ3MLLWZMP4PCVZBWT","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":"dcb5c7b5ffb4a597984cb27d6fd3267c5cb005f4412cec3b2937471e34a123d7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-28T14:06:34Z","title_canon_sha256":"998ff287feaa592dcc9c018ed1c3c2dd29cbee3a84f7989ac3769fc487f9b72f"},"schema_version":"1.0","source":{"id":"1010.5975","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5975","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5975v3","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5975","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"DW6D3OIOFQ3M","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DW6D3OIOFQ3MLLWZ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DW6D3OIO","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:7e97db8c3036e6578559773fef9db2efe8c5482f1773df09f8355d64d22449de","target":"graph","created_at":"2026-05-18T03:52:15Z","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":"In an undirected graph $G$, a subset $C\\subseteq V(G)$ such that $C$ is a dominating set of $G$, and each vertex in $V(G)$ is dominated by a distinct subset of vertices from $C$, is called an identifying code of $G$. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph $G$, let $\\M(G)$ be the minimum cardinality of an identifying code in $G$. In this paper, we show that for any connected identifiable triangle-free graph $G$ on $n$ vertices having maximum degree $\\Delta\\geq 3$, $\\M(G)\\le n-\\tfrac{n}{\\Delta+o(\\Delta)}$. Thi","authors_text":"Adrian Kosowski (LaBRI, Andr\\'e Raspaud (LaBRI), Florent Foucaud (LaBRI), INRIA Bordeaux - Sud-Ouest), Ralf Klasing (LaBRI","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-28T14:06:34Z","title":"On the size of identifying codes in triangle-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5975","kind":"arxiv","version":3},"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:63198289f7425cee43577ca03d28029fdedf720b121c4b6757cca17bfe64cee2","target":"record","created_at":"2026-05-18T03:52:15Z","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":"dcb5c7b5ffb4a597984cb27d6fd3267c5cb005f4412cec3b2937471e34a123d7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-10-28T14:06:34Z","title_canon_sha256":"998ff287feaa592dcc9c018ed1c3c2dd29cbee3a84f7989ac3769fc487f9b72f"},"schema_version":"1.0","source":{"id":"1010.5975","kind":"arxiv","version":3}},"canonical_sha256":"1dbc3db90e2c36c5aed963f8f15721b4dca4cbb373e291f9174e3e1992dcb1b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dbc3db90e2c36c5aed963f8f15721b4dca4cbb373e291f9174e3e1992dcb1b3","first_computed_at":"2026-05-18T03:52:15.162109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:15.162109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XyU2y90xXD5+KtoH6u/5Uqrrs+Vpxa/M+7QMG+Mr6DBNxYi3pgYr2iq8MJLweVXEzG0LK+1YdV3BwMlkLnCRCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:15.162823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5975","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63198289f7425cee43577ca03d28029fdedf720b121c4b6757cca17bfe64cee2","sha256:7e97db8c3036e6578559773fef9db2efe8c5482f1773df09f8355d64d22449de"],"state_sha256":"1ac52ed59ea131c853ddde68bc1432769ffc5a4f1b04c35e100225b56a6e5f8f"}