{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PIIZB4WHR4SK3WWV3DDITF3IDC","short_pith_number":"pith:PIIZB4WH","schema_version":"1.0","canonical_sha256":"7a1190f2c78f24addad5d8c689976818a470b537edc25f49f5ef2256fa136a59","source":{"kind":"arxiv","id":"1708.00219","version":1},"attestation_state":"computed","paper":{"title":"Some Results on [1, k]-sets of Lexicographic Products of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"M.R. Hooshmandasl, P. Sharifani","submitted_at":"2017-08-01T09:30:40Z","abstract_excerpt":"A subset $S \\subseteq V$ in a graph $G = (V,E)$ is called a $[1, k]$-set, if for every vertex $v \\in V \\setminus S$, $1 \\leq | N_G(v) \\cap S | \\leq k$. The $[1,k]$-domination number of $G$, denoted by $\\gamma_{[1, k]}(G)$ is the size of the smallest $[1,k]$-sets of $G$. A set $S'\\subseteq V(G)$ is called a total $[1,k]$-set, if for every vertex $v \\in V$, $1 \\leq | N_G(v) \\cap S | \\leq k$. If a graph $G$ has at least one total $[1, k]$-set then the cardinality of the smallest such set is denoted by $\\gamma_{t[1, k]}(G)$. We consider $[1, k]$-sets that are also independent. Note that not every "},"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":"1708.00219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T09:30:40Z","cross_cats_sorted":[],"title_canon_sha256":"c3b60d746343e18b316c2da316196b3dad0e57d3cc5cd255623f73aba1a34ba3","abstract_canon_sha256":"1517ec0d1e92a3ef8fde7403e21ea7194543955736d49bab0801170fb8923d42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:05.776698Z","signature_b64":"XAbsrjyLSXkNhUtb3+7nVbrYWN0P0KZQTBLbMqRd0RaKTRC6iMqINA8Ep7S/u8BFf4ds84HgE/8xUgdCrNqUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a1190f2c78f24addad5d8c689976818a470b537edc25f49f5ef2256fa136a59","last_reissued_at":"2026-05-18T00:39:05.776176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:05.776176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Results on [1, k]-sets of Lexicographic Products of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"M.R. Hooshmandasl, P. Sharifani","submitted_at":"2017-08-01T09:30:40Z","abstract_excerpt":"A subset $S \\subseteq V$ in a graph $G = (V,E)$ is called a $[1, k]$-set, if for every vertex $v \\in V \\setminus S$, $1 \\leq | N_G(v) \\cap S | \\leq k$. The $[1,k]$-domination number of $G$, denoted by $\\gamma_{[1, k]}(G)$ is the size of the smallest $[1,k]$-sets of $G$. A set $S'\\subseteq V(G)$ is called a total $[1,k]$-set, if for every vertex $v \\in V$, $1 \\leq | N_G(v) \\cap S | \\leq k$. If a graph $G$ has at least one total $[1, k]$-set then the cardinality of the smallest such set is denoted by $\\gamma_{t[1, k]}(G)$. We consider $[1, k]$-sets that are also independent. Note that not every "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00219","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":"1708.00219","created_at":"2026-05-18T00:39:05.776263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00219v1","created_at":"2026-05-18T00:39:05.776263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00219","created_at":"2026-05-18T00:39:05.776263+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIIZB4WHR4SK","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIIZB4WHR4SK3WWV","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIIZB4WH","created_at":"2026-05-18T12:31:37.085036+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/PIIZB4WHR4SK3WWV3DDITF3IDC","json":"https://pith.science/pith/PIIZB4WHR4SK3WWV3DDITF3IDC.json","graph_json":"https://pith.science/api/pith-number/PIIZB4WHR4SK3WWV3DDITF3IDC/graph.json","events_json":"https://pith.science/api/pith-number/PIIZB4WHR4SK3WWV3DDITF3IDC/events.json","paper":"https://pith.science/paper/PIIZB4WH"},"agent_actions":{"view_html":"https://pith.science/pith/PIIZB4WHR4SK3WWV3DDITF3IDC","download_json":"https://pith.science/pith/PIIZB4WHR4SK3WWV3DDITF3IDC.json","view_paper":"https://pith.science/paper/PIIZB4WH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00219&json=true","fetch_graph":"https://pith.science/api/pith-number/PIIZB4WHR4SK3WWV3DDITF3IDC/graph.json","fetch_events":"https://pith.science/api/pith-number/PIIZB4WHR4SK3WWV3DDITF3IDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIIZB4WHR4SK3WWV3DDITF3IDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIIZB4WHR4SK3WWV3DDITF3IDC/action/storage_attestation","attest_author":"https://pith.science/pith/PIIZB4WHR4SK3WWV3DDITF3IDC/action/author_attestation","sign_citation":"https://pith.science/pith/PIIZB4WHR4SK3WWV3DDITF3IDC/action/citation_signature","submit_replication":"https://pith.science/pith/PIIZB4WHR4SK3WWV3DDITF3IDC/action/replication_record"}},"created_at":"2026-05-18T00:39:05.776263+00:00","updated_at":"2026-05-18T00:39:05.776263+00:00"}