{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Y7BVMW7E4ASLYZCETZT5QX5NEU","short_pith_number":"pith:Y7BVMW7E","schema_version":"1.0","canonical_sha256":"c7c3565be4e024bc64449e67d85fad252545e81b4e7145089d5df197c77aedab","source":{"kind":"arxiv","id":"1901.07735","version":1},"attestation_state":"computed","paper":{"title":"Domination Parameters in Hypertrees and Sibling trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Indra Rajasingh, R. Jayagopal, R. Sundara Rajan","submitted_at":"2019-01-23T06:04:54Z","abstract_excerpt":"A locating-dominating set (LDS) of a graph $G$ is a dominating set $S$ of $G$ such that for every two vertices $u$ and $v$ in $V(G) \\setminus S$, $N(u)\\cap S \\neq N(v)\\cap S$. The locating-domination number $\\gamma^{L}(G)$ is the minimum cardinality of a LDS of $G$. Further if $S$ is a total dominating set then $S$ is called a locating-total dominating set. In this paper we determine the domination, total domination, locating-domination and locating-total domination numbers for hypertrees and sibling trees."},"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":"1901.07735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-23T06:04:54Z","cross_cats_sorted":[],"title_canon_sha256":"b83a8ee31ca80c70805e32c32e498ce65dac041d3fc8b44b506eafd71a1c2383","abstract_canon_sha256":"c441d180577fd6af0189b9e53e18c1c7cb0e35825825daba53af0e8c5c83116a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:41.651874Z","signature_b64":"o5qJdDxTAUbwOTjRxA5RdnPFLNdLP+J/UibOh3pMXdrQccuHcnnqx99rewNHB/H0y3a2m5jOkriamWJZy+DWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7c3565be4e024bc64449e67d85fad252545e81b4e7145089d5df197c77aedab","last_reissued_at":"2026-05-17T23:55:41.651248Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:41.651248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination Parameters in Hypertrees and Sibling trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Indra Rajasingh, R. Jayagopal, R. Sundara Rajan","submitted_at":"2019-01-23T06:04:54Z","abstract_excerpt":"A locating-dominating set (LDS) of a graph $G$ is a dominating set $S$ of $G$ such that for every two vertices $u$ and $v$ in $V(G) \\setminus S$, $N(u)\\cap S \\neq N(v)\\cap S$. The locating-domination number $\\gamma^{L}(G)$ is the minimum cardinality of a LDS of $G$. Further if $S$ is a total dominating set then $S$ is called a locating-total dominating set. In this paper we determine the domination, total domination, locating-domination and locating-total domination numbers for hypertrees and sibling trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07735","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":"1901.07735","created_at":"2026-05-17T23:55:41.651331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07735v1","created_at":"2026-05-17T23:55:41.651331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07735","created_at":"2026-05-17T23:55:41.651331+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7BVMW7E4ASL","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7BVMW7E4ASLYZCE","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7BVMW7E","created_at":"2026-05-18T12:33:33.725879+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/Y7BVMW7E4ASLYZCETZT5QX5NEU","json":"https://pith.science/pith/Y7BVMW7E4ASLYZCETZT5QX5NEU.json","graph_json":"https://pith.science/api/pith-number/Y7BVMW7E4ASLYZCETZT5QX5NEU/graph.json","events_json":"https://pith.science/api/pith-number/Y7BVMW7E4ASLYZCETZT5QX5NEU/events.json","paper":"https://pith.science/paper/Y7BVMW7E"},"agent_actions":{"view_html":"https://pith.science/pith/Y7BVMW7E4ASLYZCETZT5QX5NEU","download_json":"https://pith.science/pith/Y7BVMW7E4ASLYZCETZT5QX5NEU.json","view_paper":"https://pith.science/paper/Y7BVMW7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07735&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7BVMW7E4ASLYZCETZT5QX5NEU/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7BVMW7E4ASLYZCETZT5QX5NEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7BVMW7E4ASLYZCETZT5QX5NEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7BVMW7E4ASLYZCETZT5QX5NEU/action/storage_attestation","attest_author":"https://pith.science/pith/Y7BVMW7E4ASLYZCETZT5QX5NEU/action/author_attestation","sign_citation":"https://pith.science/pith/Y7BVMW7E4ASLYZCETZT5QX5NEU/action/citation_signature","submit_replication":"https://pith.science/pith/Y7BVMW7E4ASLYZCETZT5QX5NEU/action/replication_record"}},"created_at":"2026-05-17T23:55:41.651331+00:00","updated_at":"2026-05-17T23:55:41.651331+00:00"}