{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DFYETODLJ4B4U2PN3WPXWS47JQ","short_pith_number":"pith:DFYETODL","schema_version":"1.0","canonical_sha256":"197049b86b4f03ca69eddd9f7b4b9f4c16191e70cd64004161722178b993d013","source":{"kind":"arxiv","id":"1309.5461","version":4},"attestation_state":"computed","paper":{"title":"Linear kernels for k-tuple and liar's domination in bounded genus graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arijit Bishnu, Arijit Ghosh, Subhabrata Paul","submitted_at":"2013-09-21T11:07:24Z","abstract_excerpt":"A set $D\\subseteq V$ is called a $k$-tuple dominating set of a graph $G=(V,E)$ if $\\left| N_G[v] \\cap D \\right| \\geq k$ for all $v \\in V$, where $N_G[v]$ denotes the closed neighborhood of $v$. A set $D \\subseteq V$ is called a liar's dominating set of a graph $G=(V,E)$ if (i) $\\left| N_G[v] \\cap D \\right| \\geq 2$ for all $v\\in V$ and (ii) for every pair of distinct vertices $u, v\\in V$, $\\left| (N_G[u] \\cup N_G[v]) \\cap D \\right| \\geq 3$. Given a graph $G$, the decision versions of $k$-Tuple Domination Problem and the Liar's Domination Problem are to check whether there exists a $k$-tuple dom"},"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":"1309.5461","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-09-21T11:07:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bfa93917fca6aaf218fc449c5b33ba2952c54f72a369e3c1ae80cd0f61e730a5","abstract_canon_sha256":"ae718989ab00867ae85b8b6514d53076dff37bbf0c60946b6671a55c8eefde01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:04.724986Z","signature_b64":"hbKlO+Q0IIhqBlcPimwigcnT6X8dW5NjsTUoN0DDRg0KbbEXubwu1Go5trGLjtpsLQwchsbwaKGIgA3zcIdrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"197049b86b4f03ca69eddd9f7b4b9f4c16191e70cd64004161722178b993d013","last_reissued_at":"2026-05-18T02:45:04.724514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:04.724514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear kernels for k-tuple and liar's domination in bounded genus graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arijit Bishnu, Arijit Ghosh, Subhabrata Paul","submitted_at":"2013-09-21T11:07:24Z","abstract_excerpt":"A set $D\\subseteq V$ is called a $k$-tuple dominating set of a graph $G=(V,E)$ if $\\left| N_G[v] \\cap D \\right| \\geq k$ for all $v \\in V$, where $N_G[v]$ denotes the closed neighborhood of $v$. A set $D \\subseteq V$ is called a liar's dominating set of a graph $G=(V,E)$ if (i) $\\left| N_G[v] \\cap D \\right| \\geq 2$ for all $v\\in V$ and (ii) for every pair of distinct vertices $u, v\\in V$, $\\left| (N_G[u] \\cup N_G[v]) \\cap D \\right| \\geq 3$. Given a graph $G$, the decision versions of $k$-Tuple Domination Problem and the Liar's Domination Problem are to check whether there exists a $k$-tuple dom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5461","kind":"arxiv","version":4},"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":"1309.5461","created_at":"2026-05-18T02:45:04.724580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5461v4","created_at":"2026-05-18T02:45:04.724580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5461","created_at":"2026-05-18T02:45:04.724580+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFYETODLJ4B4","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFYETODLJ4B4U2PN","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFYETODL","created_at":"2026-05-18T12:27:43.054852+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/DFYETODLJ4B4U2PN3WPXWS47JQ","json":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ.json","graph_json":"https://pith.science/api/pith-number/DFYETODLJ4B4U2PN3WPXWS47JQ/graph.json","events_json":"https://pith.science/api/pith-number/DFYETODLJ4B4U2PN3WPXWS47JQ/events.json","paper":"https://pith.science/paper/DFYETODL"},"agent_actions":{"view_html":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ","download_json":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ.json","view_paper":"https://pith.science/paper/DFYETODL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5461&json=true","fetch_graph":"https://pith.science/api/pith-number/DFYETODLJ4B4U2PN3WPXWS47JQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DFYETODLJ4B4U2PN3WPXWS47JQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/action/storage_attestation","attest_author":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/action/author_attestation","sign_citation":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/action/citation_signature","submit_replication":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/action/replication_record"}},"created_at":"2026-05-18T02:45:04.724580+00:00","updated_at":"2026-05-18T02:45:04.724580+00:00"}