{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2MEET2M62RGZXLQYUSJRKHNAWU","short_pith_number":"pith:2MEET2M6","schema_version":"1.0","canonical_sha256":"d30849e99ed44d9bae18a493151da0b526617222e9c0f19b53a15a2c2e1dc557","source":{"kind":"arxiv","id":"1412.2376","version":2},"attestation_state":"computed","paper":{"title":"Locating-dominating sets in twin-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian L\\\"owenstein, Florent Foucaud, Michael A. Henning, Thomas Sasse","submitted_at":"2014-12-07T17:32:56Z","abstract_excerpt":"A locating-dominating set of a graph $G$ is a dominating set $D$ of $G$ with the additional property that every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \\cap D \\ne N(v) \\cap D$ where $N(u)$ denotes the open neighborhood of $u$. A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. The location-domination number of $G$, denoted $\\gamma_L(G)$, is the minimum cardinality of a locating-dominating set in $G$. It is conjectured [D. Garijo, A. Gonz\\'alez and A. M\\'arquez. "},"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":"1412.2376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-07T17:32:56Z","cross_cats_sorted":[],"title_canon_sha256":"473f8ef4ac8105267f692ca6f8d6023c49ec28444c2e87e44e9379c5344676a9","abstract_canon_sha256":"64ff475cf08f670e4e1ff853c224311f7a8f0374c763750ed9d3ead2beda3ba9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:41.599576Z","signature_b64":"kj7uY8aDTTJOykwqG9BRqJyERMC6A6/qPzukcu11Z6pbWwYGtRTcdt0dCMiaNR/sfn7bOJL6972j7kPl2aQOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d30849e99ed44d9bae18a493151da0b526617222e9c0f19b53a15a2c2e1dc557","last_reissued_at":"2026-05-18T01:22:41.599153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:41.599153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locating-dominating sets in twin-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian L\\\"owenstein, Florent Foucaud, Michael A. Henning, Thomas Sasse","submitted_at":"2014-12-07T17:32:56Z","abstract_excerpt":"A locating-dominating set of a graph $G$ is a dominating set $D$ of $G$ with the additional property that every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \\cap D \\ne N(v) \\cap D$ where $N(u)$ denotes the open neighborhood of $u$. A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. The location-domination number of $G$, denoted $\\gamma_L(G)$, is the minimum cardinality of a locating-dominating set in $G$. It is conjectured [D. Garijo, A. Gonz\\'alez and A. M\\'arquez. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2376","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":"1412.2376","created_at":"2026-05-18T01:22:41.599212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2376v2","created_at":"2026-05-18T01:22:41.599212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2376","created_at":"2026-05-18T01:22:41.599212+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MEET2M62RGZ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MEET2M62RGZXLQY","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MEET2M6","created_at":"2026-05-18T12:28:11.866339+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/2MEET2M62RGZXLQYUSJRKHNAWU","json":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU.json","graph_json":"https://pith.science/api/pith-number/2MEET2M62RGZXLQYUSJRKHNAWU/graph.json","events_json":"https://pith.science/api/pith-number/2MEET2M62RGZXLQYUSJRKHNAWU/events.json","paper":"https://pith.science/paper/2MEET2M6"},"agent_actions":{"view_html":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU","download_json":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU.json","view_paper":"https://pith.science/paper/2MEET2M6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2376&json=true","fetch_graph":"https://pith.science/api/pith-number/2MEET2M62RGZXLQYUSJRKHNAWU/graph.json","fetch_events":"https://pith.science/api/pith-number/2MEET2M62RGZXLQYUSJRKHNAWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU/action/storage_attestation","attest_author":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU/action/author_attestation","sign_citation":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU/action/citation_signature","submit_replication":"https://pith.science/pith/2MEET2M62RGZXLQYUSJRKHNAWU/action/replication_record"}},"created_at":"2026-05-18T01:22:41.599212+00:00","updated_at":"2026-05-18T01:22:41.599212+00:00"}