{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:V6OMJSQMLXXF5TKND32FNMB2BJ","short_pith_number":"pith:V6OMJSQM","schema_version":"1.0","canonical_sha256":"af9cc4ca0c5dee5ecd4d1ef456b03a0a4a39de2bca9ea7c1fb9cec0f5a5f0462","source":{"kind":"arxiv","id":"1902.04913","version":1},"attestation_state":"computed","paper":{"title":"Sufficient conditions for a digraph to admit a $(1,\\leq\\ell)$-identifying code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B. Mart\\'inez-Barona, C. Balbuena, C. Dalf\\'o","submitted_at":"2019-02-13T14:21:26Z","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"},"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":"1902.04913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-13T14:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"6b1551c608edf39056bf6415d1a43dfb6ca9a8f8f19c91a3cdcecae3b8295639","abstract_canon_sha256":"42238fca4c69988702048b011619e2087b5f2edbc5728ddab1be21d7d2640506"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:03.893169Z","signature_b64":"zOgXIg47sh25sUAVI4qs4TDr9qv6fcITiEBa1bW0BD7nJtpIcQuas9LJK06G0coeEbQQIZj0ViKmFWBZimDMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af9cc4ca0c5dee5ecd4d1ef456b03a0a4a39de2bca9ea7c1fb9cec0f5a5f0462","last_reissued_at":"2026-05-17T23:54:03.892702Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:03.892702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sufficient conditions for a digraph to admit a $(1,\\leq\\ell)$-identifying code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B. Mart\\'inez-Barona, C. Balbuena, C. Dalf\\'o","submitted_at":"2019-02-13T14:21:26Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04913","kind":"arxiv","version":1},"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":"1902.04913","created_at":"2026-05-17T23:54:03.892771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04913v1","created_at":"2026-05-17T23:54:03.892771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04913","created_at":"2026-05-17T23:54:03.892771+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6OMJSQMLXXF","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6OMJSQMLXXF5TKN","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6OMJSQM","created_at":"2026-05-18T12:33:30.264802+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/V6OMJSQMLXXF5TKND32FNMB2BJ","json":"https://pith.science/pith/V6OMJSQMLXXF5TKND32FNMB2BJ.json","graph_json":"https://pith.science/api/pith-number/V6OMJSQMLXXF5TKND32FNMB2BJ/graph.json","events_json":"https://pith.science/api/pith-number/V6OMJSQMLXXF5TKND32FNMB2BJ/events.json","paper":"https://pith.science/paper/V6OMJSQM"},"agent_actions":{"view_html":"https://pith.science/pith/V6OMJSQMLXXF5TKND32FNMB2BJ","download_json":"https://pith.science/pith/V6OMJSQMLXXF5TKND32FNMB2BJ.json","view_paper":"https://pith.science/paper/V6OMJSQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04913&json=true","fetch_graph":"https://pith.science/api/pith-number/V6OMJSQMLXXF5TKND32FNMB2BJ/graph.json","fetch_events":"https://pith.science/api/pith-number/V6OMJSQMLXXF5TKND32FNMB2BJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6OMJSQMLXXF5TKND32FNMB2BJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6OMJSQMLXXF5TKND32FNMB2BJ/action/storage_attestation","attest_author":"https://pith.science/pith/V6OMJSQMLXXF5TKND32FNMB2BJ/action/author_attestation","sign_citation":"https://pith.science/pith/V6OMJSQMLXXF5TKND32FNMB2BJ/action/citation_signature","submit_replication":"https://pith.science/pith/V6OMJSQMLXXF5TKND32FNMB2BJ/action/replication_record"}},"created_at":"2026-05-17T23:54:03.892771+00:00","updated_at":"2026-05-17T23:54:03.892771+00:00"}