{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7LMJKU6JEEKGVXWFEGF2CFSDNM","short_pith_number":"pith:7LMJKU6J","schema_version":"1.0","canonical_sha256":"fad89553c921146adec5218ba116436b32885f6768e4ed88f4c81065ee9b38e2","source":{"kind":"arxiv","id":"1107.0207","version":2},"attestation_state":"computed","paper":{"title":"Identifying codes in line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Aline Parreau (IF), Florent Foucaud (LaBRI), Petru Valicov (LaBRI), Reza Naserasr (LaBRI), Sylvain Gravier (IF)","submitted_at":"2011-07-01T12:18:42Z","abstract_excerpt":"An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code problem in line graphs. If $\\ID(G)$ denotes the size of a minimum identifying code of an identifiable graph $G$, we show that the usual bound $\\ID(G)\\ge \\lceil\\log_2(n+1)\\rceil$, where $n$ denotes the order of $G$, can be improved to $\\Theta(\\sqrt{n})$ in the class of line graphs. Moreover, this bound is tight. We also prove that the upper bound $\\ID(\\mathcal{L}(G"},"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":"1107.0207","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-01T12:18:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e8d193de546ccf0c43e3f7d77d6514e98c188dcb2eebdd89b11b8e9ed3e73937","abstract_canon_sha256":"4994f80cf948ae88befc5e7f4f5aa07d0ca32ddbcdb6bd08bbe09c952bb97547"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:11.900041Z","signature_b64":"mZLr3lOVwdF+ryKC8UuQMCUAxJnLHdRjQQC1dlGFn6rEQkN9wc1LhslyMzKnwPW2w2xp5Qyh3jyk4GQdANa6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fad89553c921146adec5218ba116436b32885f6768e4ed88f4c81065ee9b38e2","last_reissued_at":"2026-05-18T02:56:11.899641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:11.899641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying codes in line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Aline Parreau (IF), Florent Foucaud (LaBRI), Petru Valicov (LaBRI), Reza Naserasr (LaBRI), Sylvain Gravier (IF)","submitted_at":"2011-07-01T12:18:42Z","abstract_excerpt":"An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code problem in line graphs. If $\\ID(G)$ denotes the size of a minimum identifying code of an identifiable graph $G$, we show that the usual bound $\\ID(G)\\ge \\lceil\\log_2(n+1)\\rceil$, where $n$ denotes the order of $G$, can be improved to $\\Theta(\\sqrt{n})$ in the class of line graphs. Moreover, this bound is tight. We also prove that the upper bound $\\ID(\\mathcal{L}(G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0207","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.0207","created_at":"2026-05-18T02:56:11.899719+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0207v2","created_at":"2026-05-18T02:56:11.899719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0207","created_at":"2026-05-18T02:56:11.899719+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LMJKU6JEEKG","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LMJKU6JEEKGVXWF","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LMJKU6J","created_at":"2026-05-18T12:26:22.705136+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/7LMJKU6JEEKGVXWFEGF2CFSDNM","json":"https://pith.science/pith/7LMJKU6JEEKGVXWFEGF2CFSDNM.json","graph_json":"https://pith.science/api/pith-number/7LMJKU6JEEKGVXWFEGF2CFSDNM/graph.json","events_json":"https://pith.science/api/pith-number/7LMJKU6JEEKGVXWFEGF2CFSDNM/events.json","paper":"https://pith.science/paper/7LMJKU6J"},"agent_actions":{"view_html":"https://pith.science/pith/7LMJKU6JEEKGVXWFEGF2CFSDNM","download_json":"https://pith.science/pith/7LMJKU6JEEKGVXWFEGF2CFSDNM.json","view_paper":"https://pith.science/paper/7LMJKU6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0207&json=true","fetch_graph":"https://pith.science/api/pith-number/7LMJKU6JEEKGVXWFEGF2CFSDNM/graph.json","fetch_events":"https://pith.science/api/pith-number/7LMJKU6JEEKGVXWFEGF2CFSDNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LMJKU6JEEKGVXWFEGF2CFSDNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LMJKU6JEEKGVXWFEGF2CFSDNM/action/storage_attestation","attest_author":"https://pith.science/pith/7LMJKU6JEEKGVXWFEGF2CFSDNM/action/author_attestation","sign_citation":"https://pith.science/pith/7LMJKU6JEEKGVXWFEGF2CFSDNM/action/citation_signature","submit_replication":"https://pith.science/pith/7LMJKU6JEEKGVXWFEGF2CFSDNM/action/replication_record"}},"created_at":"2026-05-18T02:56:11.899719+00:00","updated_at":"2026-05-18T02:56:11.899719+00:00"}