{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KRNF3CFKGJUYMHLWQ5RG5PPQPC","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":"edc0f6f0d268871873b7a023308cac2a183509c94a630f1c162fff60842f731a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-13T15:25:26Z","title_canon_sha256":"de6f9b00f22831f5c5d72f4f45a606919260aff179aba24c3531ecb33d483f2f"},"schema_version":"1.0","source":{"id":"1905.05083","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05083","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05083v2","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05083","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"KRNF3CFKGJUY","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KRNF3CFKGJUYMHLW","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KRNF3CFK","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:bc0f642a321d282172d6403e15fe4c9081caad0226dd0b905f3847bfacf5bda8","target":"graph","created_at":"2026-05-17T23:45:56Z","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":"Given an integer $\\ell\\ge 1$, a $(1,\\le \\ell)$-identifying code in a digraph is a dominating subset $C$ of vertices such that all distinct subsets of vertices of cardinality at most $\\ell$ have distinct closed in-neighbourhood within $C$. In this paper, we prove that every $k$-iterated line digraph of minimum in-degree at least 2 and $k\\geq2$, or minimum in-degree at least 3 and $k\\geq1$, admits a $(1,\\le \\ell)$-identifying code with $\\ell\\leq2$, and in any case it does not admit a $(1,\\le \\ell)$-identifying code for $\\ell\\geq3$. Moreover, we find that the identifying number of a line digraph ","authors_text":"B. Mart\\'inez-Barona, C. Balbuena, C. Dalf\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-13T15:25:26Z","title":"Identifying codes in line digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05083","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:6f863da8d9dcff2867c433aea0a6e35012e9acbc159fa747a3b9a9b09498e9a0","target":"record","created_at":"2026-05-17T23:45:56Z","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":"edc0f6f0d268871873b7a023308cac2a183509c94a630f1c162fff60842f731a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-13T15:25:26Z","title_canon_sha256":"de6f9b00f22831f5c5d72f4f45a606919260aff179aba24c3531ecb33d483f2f"},"schema_version":"1.0","source":{"id":"1905.05083","kind":"arxiv","version":2}},"canonical_sha256":"545a5d88aa3269861d7687626ebdf078b21a495eb0d2c7fd9622e773f70a7cc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"545a5d88aa3269861d7687626ebdf078b21a495eb0d2c7fd9622e773f70a7cc1","first_computed_at":"2026-05-17T23:45:56.359455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:56.359455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rc5LpNhA8e1NoOUmN8Pu+VGGwYTyyejOXI0QldSXIar3Scv1R+oPZ2GULkwlROOYxj12FFetoCaIGOOUDACSDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:56.359947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05083","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f863da8d9dcff2867c433aea0a6e35012e9acbc159fa747a3b9a9b09498e9a0","sha256:bc0f642a321d282172d6403e15fe4c9081caad0226dd0b905f3847bfacf5bda8"],"state_sha256":"f1c26f08ef946ec11a1ee2de6cae98c1a5697906b49ce7d5735db18fae764005"}