{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V6OMJSQMLXXF5TKND32FNMB2BJ","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":"42238fca4c69988702048b011619e2087b5f2edbc5728ddab1be21d7d2640506","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-13T14:21:26Z","title_canon_sha256":"6b1551c608edf39056bf6415d1a43dfb6ca9a8f8f19c91a3cdcecae3b8295639"},"schema_version":"1.0","source":{"id":"1902.04913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04913","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04913v1","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04913","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"pith_short_12","alias_value":"V6OMJSQMLXXF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V6OMJSQMLXXF5TKN","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V6OMJSQM","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:2b1e7bb062dbc3a3e41eed20e894ace0cd034a1fd76d53f97f1bb392cb5b7cd7","target":"graph","created_at":"2026-05-17T23:54:03Z","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":"A $(1,\\le \\ell)$-identifying code in a digraph $D$ is a subset $C$ of vertices of $D$ such that all distinct subsets of vertices of cardinality at most $\\ell$ have different closed in-neighborhoods within $C$. In this paper, we give some sufficient conditions for a digraph of minimum in-degree $\\delta^-\\ge 1$ to admit a $(1,\\le \\ell)$-identifying code for $\\ell=\\delta^-, \\delta^-+1$. As a corollary, we obtain the result by Laihonen that states that a graph of minimum degree $\\delta\\ge 2$ and girth at least 7 admits a $(1,\\le \\delta)$-identifying code. Moreover, we prove that every $1$-in-regul","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-02-13T14:21:26Z","title":"Sufficient conditions for a digraph to admit a $(1,\\leq\\ell)$-identifying code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04913","kind":"arxiv","version":1},"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:b1304d7f20f4d39ecd3c1b59eb00a7e9ba3d551e1e440c8873445c4b65a08816","target":"record","created_at":"2026-05-17T23:54:03Z","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":"42238fca4c69988702048b011619e2087b5f2edbc5728ddab1be21d7d2640506","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-13T14:21:26Z","title_canon_sha256":"6b1551c608edf39056bf6415d1a43dfb6ca9a8f8f19c91a3cdcecae3b8295639"},"schema_version":"1.0","source":{"id":"1902.04913","kind":"arxiv","version":1}},"canonical_sha256":"af9cc4ca0c5dee5ecd4d1ef456b03a0a4a39de2bca9ea7c1fb9cec0f5a5f0462","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af9cc4ca0c5dee5ecd4d1ef456b03a0a4a39de2bca9ea7c1fb9cec0f5a5f0462","first_computed_at":"2026-05-17T23:54:03.892702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:03.892702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zOgXIg47sh25sUAVI4qs4TDr9qv6fcITiEBa1bW0BD7nJtpIcQuas9LJK06G0coeEbQQIZj0ViKmFWBZimDMBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:03.893169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1304d7f20f4d39ecd3c1b59eb00a7e9ba3d551e1e440c8873445c4b65a08816","sha256:2b1e7bb062dbc3a3e41eed20e894ace0cd034a1fd76d53f97f1bb392cb5b7cd7"],"state_sha256":"ee149ed0d1dec05cd8fc2aeed2c56ae9c7d014b7af9c3141823c3c6e31ddffe7"}