{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:B5FXPNF6CANA62EK7XXZLR672D","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":"6919c039769b0b92817bf6d6b9fc2fdde6ee381273bd709226eff3905c0a135a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T10:31:28Z","title_canon_sha256":"26c2a0a795ddb1db31f1f58f91c25cc48bdc14f7a280da0aed0293a8062eb3df"},"schema_version":"1.0","source":{"id":"2606.22428","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22428","created_at":"2026-06-23T02:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22428v1","created_at":"2026-06-23T02:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22428","created_at":"2026-06-23T02:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"B5FXPNF6CANA","created_at":"2026-06-23T02:13:38Z"},{"alias_kind":"pith_short_16","alias_value":"B5FXPNF6CANA62EK","created_at":"2026-06-23T02:13:38Z"},{"alias_kind":"pith_short_8","alias_value":"B5FXPNF6","created_at":"2026-06-23T02:13:38Z"}],"graph_snapshots":[{"event_id":"sha256:cf561592c8452f139ad8c5426789b916a1a2b1a54aad42855c647b995aea1b87","target":"graph","created_at":"2026-06-23T02:13:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.22428/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A dominating set is called $k$-limited if every vertex in the set has at most $k$ neighbors outside it. The minimum cardinality of a $k$-limited dominating set is the $k$-limited domination number, denoted by $\\gamma_k^{\\mathrm{L}}(G)$. We prove that, for every fixed integer $k\\ge 2$, deciding whether a graph admits a $k$-limited dominating set of size at most $\\ell$ is $\\mathsf{NP}$-complete. In addition, a systematic study of $k$-limited domination in Cartesian products is initiated. In particular, we establish general lower and upper bounds for $\\gamma_k^{\\mathrm{L}}(G\\square H)$, show that","authors_text":"Aleksandra Tepeh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T10:31:28Z","title":"On $k$-limited domination: complexity and Cartesian products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22428","kind":"arxiv","version":1},"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:11d7ffdc08fe278a864dbc0f7de4022998a888d8a34d435217e361b3a4524e7a","target":"record","created_at":"2026-06-23T02:13:38Z","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":"6919c039769b0b92817bf6d6b9fc2fdde6ee381273bd709226eff3905c0a135a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T10:31:28Z","title_canon_sha256":"26c2a0a795ddb1db31f1f58f91c25cc48bdc14f7a280da0aed0293a8062eb3df"},"schema_version":"1.0","source":{"id":"2606.22428","kind":"arxiv","version":1}},"canonical_sha256":"0f4b77b4be101a0f688afdef95c7dfd0dfc37a4fc2d0b3e82f6a12692022f08e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f4b77b4be101a0f688afdef95c7dfd0dfc37a4fc2d0b3e82f6a12692022f08e","first_computed_at":"2026-06-23T02:13:38.197582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:38.197582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HDrbUWdo5/eILI9AH3Xiao++Y5xYQ4XOetP7u5ZbiVmhjHRVsH/fjZHBUd/+uE2ZBQ0oDEd6IJ24482SHtoIDQ==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:38.197962Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22428","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11d7ffdc08fe278a864dbc0f7de4022998a888d8a34d435217e361b3a4524e7a","sha256:cf561592c8452f139ad8c5426789b916a1a2b1a54aad42855c647b995aea1b87"],"state_sha256":"3248c775c657f6505053ce1f34ed78bee1caad6484c2e3791ee95caa3cd8e42f"}