{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DFYETODLJ4B4U2PN3WPXWS47JQ","short_pith_number":"pith:DFYETODL","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"},"canonical_sha256":"197049b86b4f03ca69eddd9f7b4b9f4c16191e70cd64004161722178b993d013","source":{"kind":"arxiv","id":"1309.5461","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5461","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5461v4","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5461","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"DFYETODLJ4B4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DFYETODLJ4B4U2PN","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DFYETODL","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DFYETODLJ4B4U2PN3WPXWS47JQ","target":"record","payload":{"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"},"canonical_sha256":"197049b86b4f03ca69eddd9f7b4b9f4c16191e70cd64004161722178b993d013","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"},"source_kind":"arxiv","source_id":"1309.5461","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMo5hl1N2blIhae0fStQq6areb/yAehcICxcBpp11mhNlpoYop/MVyc2pi+HfQELCdYYra6XOIElhXdOe3M6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:44:29.503095Z"},"content_sha256":"8c56943fe8d13b03284b4d792d322dcbc75505ee1b5ba89cf142a78b4050b311","schema_version":"1.0","event_id":"sha256:8c56943fe8d13b03284b4d792d322dcbc75505ee1b5ba89cf142a78b4050b311"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DFYETODLJ4B4U2PN3WPXWS47JQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l4oK6qIxH38WXyLaXkcp3Gi3jdVlCTdqAQ4bjhZPOcOyqDaTU+/6RMoSUa9mDmkguACB6GTZ2hmJSp3yKQ8+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:44:29.503770Z"},"content_sha256":"b71e021f490833a5f4b755833b41fb14be6689e70c1749c411ada9e1dd601b99","schema_version":"1.0","event_id":"sha256:b71e021f490833a5f4b755833b41fb14be6689e70c1749c411ada9e1dd601b99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/bundle.json","state_url":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T16:44:29Z","links":{"resolver":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ","bundle":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/bundle.json","state":"https://pith.science/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DFYETODLJ4B4U2PN3WPXWS47JQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DFYETODLJ4B4U2PN3WPXWS47JQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ae718989ab00867ae85b8b6514d53076dff37bbf0c60946b6671a55c8eefde01","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-09-21T11:07:24Z","title_canon_sha256":"bfa93917fca6aaf218fc449c5b33ba2952c54f72a369e3c1ae80cd0f61e730a5"},"schema_version":"1.0","source":{"id":"1309.5461","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5461","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5461v4","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5461","created_at":"2026-05-18T02:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"DFYETODLJ4B4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DFYETODLJ4B4U2PN","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DFYETODL","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:b71e021f490833a5f4b755833b41fb14be6689e70c1749c411ada9e1dd601b99","target":"graph","created_at":"2026-05-18T02:45:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Arijit Bishnu, Arijit Ghosh, Subhabrata Paul","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-09-21T11:07:24Z","title":"Linear kernels for k-tuple and liar's domination in bounded genus graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5461","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8c56943fe8d13b03284b4d792d322dcbc75505ee1b5ba89cf142a78b4050b311","target":"record","created_at":"2026-05-18T02:45:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ae718989ab00867ae85b8b6514d53076dff37bbf0c60946b6671a55c8eefde01","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2013-09-21T11:07:24Z","title_canon_sha256":"bfa93917fca6aaf218fc449c5b33ba2952c54f72a369e3c1ae80cd0f61e730a5"},"schema_version":"1.0","source":{"id":"1309.5461","kind":"arxiv","version":4}},"canonical_sha256":"197049b86b4f03ca69eddd9f7b4b9f4c16191e70cd64004161722178b993d013","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"197049b86b4f03ca69eddd9f7b4b9f4c16191e70cd64004161722178b993d013","first_computed_at":"2026-05-18T02:45:04.724514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:04.724514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hbKlO+Q0IIhqBlcPimwigcnT6X8dW5NjsTUoN0DDRg0KbbEXubwu1Go5trGLjtpsLQwchsbwaKGIgA3zcIdrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:04.724986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5461","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c56943fe8d13b03284b4d792d322dcbc75505ee1b5ba89cf142a78b4050b311","sha256:b71e021f490833a5f4b755833b41fb14be6689e70c1749c411ada9e1dd601b99"],"state_sha256":"41f2f2075669f6809b706d1ea174a2db92fbcf0a2d9378bafa35547daa40efa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k0QGwGFskCziDhWB3zYJH30JeFXpQidBbPrOaAFMcLYSE3tRkwqbwB5To65SSOUgU6CG2KBJAhYTfErQou5UCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T16:44:29.507298Z","bundle_sha256":"40e766b6754c1152abe14a3cfbd738556c50399fe3198be9e300706a827d3541"}}