{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OLVUOIP4PZZM3RN2W6XKPVO5NX","short_pith_number":"pith:OLVUOIP4","schema_version":"1.0","canonical_sha256":"72eb4721fc7e72cdc5bab7aea7d5dd6ddadd40cf518405b60096235ae495f556","source":{"kind":"arxiv","id":"1312.0772","version":1},"attestation_state":"computed","paper":{"title":"On global location-domination in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Hernando, I. M. Pelayo, M. Mora","submitted_at":"2013-12-03T11:23:46Z","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 location-domination number $\\lambda(G)$. An LD-set $S$ of a graph $G$ is global if it is an LD-set of both $G$ and its complement $\\overline{G}$. The global location-domination number $\\lambda_g(G)$ is the minimum cardinality of a global LD-set of $G$. In this work, we give some relations between loc"},"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":"1312.0772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-03T11:23:46Z","cross_cats_sorted":[],"title_canon_sha256":"d31f6b10426b1537c21f21973d79b49fec36dcd3ead48151a4d9ad445518a647","abstract_canon_sha256":"c7040a0c7557302713c8c163020646f859383443232230a041e9ee08c90206f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:36.738564Z","signature_b64":"NLSHK3NJlv1KUZWoIKoe4M8jwGw59V66O3lRg0u4iRO2tAbjNqLghuaZCpMqU0Xk8jzy/EX5q0tv8FHcLO1vAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72eb4721fc7e72cdc5bab7aea7d5dd6ddadd40cf518405b60096235ae495f556","last_reissued_at":"2026-05-18T03:05:36.737850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:36.737850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On global location-domination in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Hernando, I. M. Pelayo, M. Mora","submitted_at":"2013-12-03T11:23:46Z","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 location-domination number $\\lambda(G)$. An LD-set $S$ of a graph $G$ is global if it is an LD-set of both $G$ and its complement $\\overline{G}$. The global location-domination number $\\lambda_g(G)$ is the minimum cardinality of a global LD-set of $G$. In this work, we give some relations between loc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0772","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":"1312.0772","created_at":"2026-05-18T03:05:36.737949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0772v1","created_at":"2026-05-18T03:05:36.737949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0772","created_at":"2026-05-18T03:05:36.737949+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLVUOIP4PZZM","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLVUOIP4PZZM3RN2","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLVUOIP4","created_at":"2026-05-18T12:27:54.935989+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/OLVUOIP4PZZM3RN2W6XKPVO5NX","json":"https://pith.science/pith/OLVUOIP4PZZM3RN2W6XKPVO5NX.json","graph_json":"https://pith.science/api/pith-number/OLVUOIP4PZZM3RN2W6XKPVO5NX/graph.json","events_json":"https://pith.science/api/pith-number/OLVUOIP4PZZM3RN2W6XKPVO5NX/events.json","paper":"https://pith.science/paper/OLVUOIP4"},"agent_actions":{"view_html":"https://pith.science/pith/OLVUOIP4PZZM3RN2W6XKPVO5NX","download_json":"https://pith.science/pith/OLVUOIP4PZZM3RN2W6XKPVO5NX.json","view_paper":"https://pith.science/paper/OLVUOIP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0772&json=true","fetch_graph":"https://pith.science/api/pith-number/OLVUOIP4PZZM3RN2W6XKPVO5NX/graph.json","fetch_events":"https://pith.science/api/pith-number/OLVUOIP4PZZM3RN2W6XKPVO5NX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLVUOIP4PZZM3RN2W6XKPVO5NX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLVUOIP4PZZM3RN2W6XKPVO5NX/action/storage_attestation","attest_author":"https://pith.science/pith/OLVUOIP4PZZM3RN2W6XKPVO5NX/action/author_attestation","sign_citation":"https://pith.science/pith/OLVUOIP4PZZM3RN2W6XKPVO5NX/action/citation_signature","submit_replication":"https://pith.science/pith/OLVUOIP4PZZM3RN2W6XKPVO5NX/action/replication_record"}},"created_at":"2026-05-18T03:05:36.737949+00:00","updated_at":"2026-05-18T03:05:36.737949+00:00"}