{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QFNV4I755H3LON5NMN24TALRMN","short_pith_number":"pith:QFNV4I75","schema_version":"1.0","canonical_sha256":"815b5e23fde9f6b737ad6375c9817163726e15f409d3661a9d5d00bd4bf2acb6","source":{"kind":"arxiv","id":"1506.03442","version":1},"attestation_state":"computed","paper":{"title":"On global location-domination in bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Merce Mora","submitted_at":"2015-06-10T19:57:28Z","abstract_excerpt":"A dominating set $S$ of a graph $G$ is called locating-dominating, LD-set for short, if every vertex $v$ not in $S$ is uniquely determined by the set of neighbors of $v$ belonging to $S$. Locating-dominating sets of minimum cardinality are called $LD$-codes and the cardinality of an LD-code is the \\emph{location-domination number} $\\lambda(G)$. An LD-set $S$ of a graph $G$ is \\emph{global} if it is an LD-set of both $G$ and its complement $\\overline{G}$. The \\emph{global location-domination number} $\\lambda_g(G)$ is the minimum cardinality of a global LD-set of $G$.\n  For any LD-set $S$ of a 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":"1506.03442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T19:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"0df5ac92c70cf06014c26faf43204c8fadc1d3acc6678c4442c2fe41b0eff464","abstract_canon_sha256":"ff703468a141b06ed1580e46d326cdfec294235ec7ff7b25ba9187055ccbd9a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:24.725844Z","signature_b64":"WoqGPbyc0Xn1D/WFKYQYQsCKkwrjv8QADmBnN4mdhSyaOYGCxnFpwj0/tqlCefBi+136vRB3CF8R18Ul68EQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"815b5e23fde9f6b737ad6375c9817163726e15f409d3661a9d5d00bd4bf2acb6","last_reissued_at":"2026-05-18T01:55:24.725203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:24.725203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On global location-domination in bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Merce Mora","submitted_at":"2015-06-10T19:57:28Z","abstract_excerpt":"A dominating set $S$ of a graph $G$ is called locating-dominating, LD-set for short, if every vertex $v$ not in $S$ is uniquely determined by the set of neighbors of $v$ belonging to $S$. Locating-dominating sets of minimum cardinality are called $LD$-codes and the cardinality of an LD-code is the \\emph{location-domination number} $\\lambda(G)$. An LD-set $S$ of a graph $G$ is \\emph{global} if it is an LD-set of both $G$ and its complement $\\overline{G}$. The \\emph{global location-domination number} $\\lambda_g(G)$ is the minimum cardinality of a global LD-set of $G$.\n  For any LD-set $S$ of a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03442","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":"1506.03442","created_at":"2026-05-18T01:55:24.725277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03442v1","created_at":"2026-05-18T01:55:24.725277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03442","created_at":"2026-05-18T01:55:24.725277+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFNV4I755H3L","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFNV4I755H3LON5N","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFNV4I75","created_at":"2026-05-18T12:29:37.295048+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/QFNV4I755H3LON5NMN24TALRMN","json":"https://pith.science/pith/QFNV4I755H3LON5NMN24TALRMN.json","graph_json":"https://pith.science/api/pith-number/QFNV4I755H3LON5NMN24TALRMN/graph.json","events_json":"https://pith.science/api/pith-number/QFNV4I755H3LON5NMN24TALRMN/events.json","paper":"https://pith.science/paper/QFNV4I75"},"agent_actions":{"view_html":"https://pith.science/pith/QFNV4I755H3LON5NMN24TALRMN","download_json":"https://pith.science/pith/QFNV4I755H3LON5NMN24TALRMN.json","view_paper":"https://pith.science/paper/QFNV4I75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03442&json=true","fetch_graph":"https://pith.science/api/pith-number/QFNV4I755H3LON5NMN24TALRMN/graph.json","fetch_events":"https://pith.science/api/pith-number/QFNV4I755H3LON5NMN24TALRMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFNV4I755H3LON5NMN24TALRMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFNV4I755H3LON5NMN24TALRMN/action/storage_attestation","attest_author":"https://pith.science/pith/QFNV4I755H3LON5NMN24TALRMN/action/author_attestation","sign_citation":"https://pith.science/pith/QFNV4I755H3LON5NMN24TALRMN/action/citation_signature","submit_replication":"https://pith.science/pith/QFNV4I755H3LON5NMN24TALRMN/action/replication_record"}},"created_at":"2026-05-18T01:55:24.725277+00:00","updated_at":"2026-05-18T01:55:24.725277+00:00"}