{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NZL2YAV5K43SAKJPXR7SKONMMU","short_pith_number":"pith:NZL2YAV5","schema_version":"1.0","canonical_sha256":"6e57ac02bd573720292fbc7f2539ac650820f33f57356e8666cb61aa8f90eb6a","source":{"kind":"arxiv","id":"1711.01951","version":2},"attestation_state":"computed","paper":{"title":"Locating domination in bipartite graphs and their complements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Merc\\`e Mora","submitted_at":"2017-11-03T10:07:52Z","abstract_excerpt":"A set $S$ of vertices of a graph $G$ is \\emph{distinguishing} if the sets of neighbors in $S$ for every pair of vertices not in $S$ are distinct. A \\emph{locating-dominating set} of $G$ is a dominating distinguishing set. The \\emph{location-domination number} of $G$, $\\lambda(G)$, is the minimum cardinality of a locating-dominating set. In this work we study relationships between $\\lambda({G})$ and $\\lambda (\\overline{G})$ for bipartite graphs. The main result is the characterization of all connected bipartite graphs $G$ satisfying $\\lambda (\\overline{G})=\\lambda({G})+1$. To this aim, we defin"},"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":"1711.01951","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-03T10:07:52Z","cross_cats_sorted":[],"title_canon_sha256":"c058ebc4ac44b8bb5c339e2448dd13f06d3dd7dfe3cbc0fdf1283c135295e049","abstract_canon_sha256":"f69587830b55dcb44a1f4ff7ae07567b92ab94f96764a8ecf91807b5c4fa64be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:28.394975Z","signature_b64":"Y9JV3OsnvcUa/Yt48NXSEzM9paFXnWLpPmtTf3Rklol5s8dzuYKUDtpPEgxjoBx0exR3bLSDkxjumarfDst3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e57ac02bd573720292fbc7f2539ac650820f33f57356e8666cb61aa8f90eb6a","last_reissued_at":"2026-05-18T00:10:28.394362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:28.394362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locating domination in bipartite graphs and their complements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M. Pelayo, Merc\\`e Mora","submitted_at":"2017-11-03T10:07:52Z","abstract_excerpt":"A set $S$ of vertices of a graph $G$ is \\emph{distinguishing} if the sets of neighbors in $S$ for every pair of vertices not in $S$ are distinct. A \\emph{locating-dominating set} of $G$ is a dominating distinguishing set. The \\emph{location-domination number} of $G$, $\\lambda(G)$, is the minimum cardinality of a locating-dominating set. In this work we study relationships between $\\lambda({G})$ and $\\lambda (\\overline{G})$ for bipartite graphs. The main result is the characterization of all connected bipartite graphs $G$ satisfying $\\lambda (\\overline{G})=\\lambda({G})+1$. To this aim, we defin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01951","kind":"arxiv","version":2},"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":"1711.01951","created_at":"2026-05-18T00:10:28.394459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01951v2","created_at":"2026-05-18T00:10:28.394459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01951","created_at":"2026-05-18T00:10:28.394459+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZL2YAV5K43S","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZL2YAV5K43SAKJP","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZL2YAV5","created_at":"2026-05-18T12:31:34.259226+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/NZL2YAV5K43SAKJPXR7SKONMMU","json":"https://pith.science/pith/NZL2YAV5K43SAKJPXR7SKONMMU.json","graph_json":"https://pith.science/api/pith-number/NZL2YAV5K43SAKJPXR7SKONMMU/graph.json","events_json":"https://pith.science/api/pith-number/NZL2YAV5K43SAKJPXR7SKONMMU/events.json","paper":"https://pith.science/paper/NZL2YAV5"},"agent_actions":{"view_html":"https://pith.science/pith/NZL2YAV5K43SAKJPXR7SKONMMU","download_json":"https://pith.science/pith/NZL2YAV5K43SAKJPXR7SKONMMU.json","view_paper":"https://pith.science/paper/NZL2YAV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01951&json=true","fetch_graph":"https://pith.science/api/pith-number/NZL2YAV5K43SAKJPXR7SKONMMU/graph.json","fetch_events":"https://pith.science/api/pith-number/NZL2YAV5K43SAKJPXR7SKONMMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZL2YAV5K43SAKJPXR7SKONMMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZL2YAV5K43SAKJPXR7SKONMMU/action/storage_attestation","attest_author":"https://pith.science/pith/NZL2YAV5K43SAKJPXR7SKONMMU/action/author_attestation","sign_citation":"https://pith.science/pith/NZL2YAV5K43SAKJPXR7SKONMMU/action/citation_signature","submit_replication":"https://pith.science/pith/NZL2YAV5K43SAKJPXR7SKONMMU/action/replication_record"}},"created_at":"2026-05-18T00:10:28.394459+00:00","updated_at":"2026-05-18T00:10:28.394459+00:00"}