{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3ICQGBQZXCOWCL244FYKT4MEF2","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":"abca154392f23199d462d42352fee47cfb0a3735c47c17cd8d847cf2b88e1f8f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T10:18:32Z","title_canon_sha256":"e0ab2c77a49eaea34f5f6e7fb29c11acb02200e26693917aaf7bc189a8592ddd"},"schema_version":"1.0","source":{"id":"2606.22422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22422","created_at":"2026-06-23T02:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22422v1","created_at":"2026-06-23T02:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22422","created_at":"2026-06-23T02:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"3ICQGBQZXCOW","created_at":"2026-06-23T02:13:38Z"},{"alias_kind":"pith_short_16","alias_value":"3ICQGBQZXCOWCL24","created_at":"2026-06-23T02:13:38Z"},{"alias_kind":"pith_short_8","alias_value":"3ICQGBQZ","created_at":"2026-06-23T02:13:38Z"}],"graph_snapshots":[{"event_id":"sha256:db9772127667a2a72edf014db8bfdd705a22c92ff1f56c24543338ccc75c8231","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.22422/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we introduce and study the notion of $k$-limited domination in graphs, motivated by applications where dominating vertices have bounded capacity and cannot be overloaded by too many external neighbors. Formally, given an integer $k \\le \\Delta(G)$, a set of vertices $D \\subseteq V(G)$ is called a $k$-limited dominating set if it is a dominating set and, in addition, each vertex of $D$ has at most $k$ neighbors outside $D$. The minimum cardinality of such a set is the $k$-limited domination number, denoted by $\\gamma_k^{\\mathrm{L}}(G)$. Since $\\Delta(G)$-limited domination coincide","authors_text":"Aleksandra Tepeh, Dragana Bo\\v{z}ovi\\'c, Gordana Radi\\'c, \\v{Z}ana Kovijani\\'c-Vuki\\'cevi\\'c","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T10:18:32Z","title":"On $k$-limited domination in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22422","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:8746629b107d407851c6af67f7774e28e36a44d9388b049de5b6d294523df4ad","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":"abca154392f23199d462d42352fee47cfb0a3735c47c17cd8d847cf2b88e1f8f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T10:18:32Z","title_canon_sha256":"e0ab2c77a49eaea34f5f6e7fb29c11acb02200e26693917aaf7bc189a8592ddd"},"schema_version":"1.0","source":{"id":"2606.22422","kind":"arxiv","version":1}},"canonical_sha256":"da05030619b89d612f5ce170a9f1842e9d2f07ddc3cf44cd2216cea3fafe2d3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da05030619b89d612f5ce170a9f1842e9d2f07ddc3cf44cd2216cea3fafe2d3e","first_computed_at":"2026-06-23T02:13:38.043940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:38.043940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"azAcGKA43p/HpVQzprSvdyGSu1iibHc7jiAIcYxLRNZ0dQPPD3xvep9l87BzIn7GgPEB8CR2FrCKV9tcW3e1BA==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:38.044395Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8746629b107d407851c6af67f7774e28e36a44d9388b049de5b6d294523df4ad","sha256:db9772127667a2a72edf014db8bfdd705a22c92ff1f56c24543338ccc75c8231"],"state_sha256":"d8f30c116182e3a0a066348112e6d9a47066e1799c6acc79597d58f174fd1095"}