{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NMVGJR4OG3JED6TXQPLLNGPDMH","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":"22fb53b99d49be2e172f48bd8b689c6f7b08b8c32d82b698700d2f4ee7601521","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-23T19:31:47Z","title_canon_sha256":"05e32b2d6aaaccdfeb075929cae94e48ad590a4a9e50c456ca7f3802c28ce34e"},"schema_version":"1.0","source":{"id":"2605.24711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24711","created_at":"2026-05-26T01:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24711v1","created_at":"2026-05-26T01:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24711","created_at":"2026-05-26T01:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"NMVGJR4OG3JE","created_at":"2026-05-26T01:03:54Z"},{"alias_kind":"pith_short_16","alias_value":"NMVGJR4OG3JED6TX","created_at":"2026-05-26T01:03:54Z"},{"alias_kind":"pith_short_8","alias_value":"NMVGJR4O","created_at":"2026-05-26T01:03:54Z"}],"graph_snapshots":[{"event_id":"sha256:1833d0e25185e2313df9b372b1de2b685a2e3dcf4f6141fc595c39a1d6b1eb53","target":"graph","created_at":"2026-05-26T01:03:54Z","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/2605.24711/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of covering the maximum number of vertices in a graph by a collection of vertex-disjoint stars, each with a number of satellites in a given interval $[k, \\ell]$, where $1 \\le k < \\ell$ and $\\ell$ can be infinity. This is referred to as sequential {\\sc $[k, \\ell]$-Star Packing} problem. It is solvable in polynomial time when $k = 1$, but becomes strongly NP-hard when $k \\ge 2$. In this paper, we propose either the first or an improved approximation algorithm for the following four sequential settings: 1) a $\\frac {k+1}2$-approximation algorithm when $k \\ge 3$ and $\\ell = \\i","authors_text":"An Zhang, Guohui Lin, Jiaxuan Ma, Mengyuan Hu, Wei Ding, Yong Chen, Yue Sun, Zhikai Chen","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-23T19:31:47Z","title":"Covering vertices by sequential stars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24711","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:fd391cf9bd8732c11b076c0e3dc6c35fe0ac708dde518706dc1112930ac4d23c","target":"record","created_at":"2026-05-26T01:03:54Z","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":"22fb53b99d49be2e172f48bd8b689c6f7b08b8c32d82b698700d2f4ee7601521","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-23T19:31:47Z","title_canon_sha256":"05e32b2d6aaaccdfeb075929cae94e48ad590a4a9e50c456ca7f3802c28ce34e"},"schema_version":"1.0","source":{"id":"2605.24711","kind":"arxiv","version":1}},"canonical_sha256":"6b2a64c78e36d241fa7783d6b699e361e895b5a85cec4d6cb094e4646636308d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b2a64c78e36d241fa7783d6b699e361e895b5a85cec4d6cb094e4646636308d","first_computed_at":"2026-05-26T01:03:54.694992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:54.694992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9oSI4J41CRPbnrCGXFqRgPKPLy25LWIjJo32DvQ7dC0Gm5ucjnTU1RvCPUq7Eu+I6EJ0r7jOH+moOhJWU/J7Bg==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:54.695868Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.24711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd391cf9bd8732c11b076c0e3dc6c35fe0ac708dde518706dc1112930ac4d23c","sha256:1833d0e25185e2313df9b372b1de2b685a2e3dcf4f6141fc595c39a1d6b1eb53"],"state_sha256":"abe8f3a57740534b571dafbca2fc2548363cd1c9e3cd663a218985f0a426f0a6"}