{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NMVGJR4OG3JED6TXQPLLNGPDMH","short_pith_number":"pith:NMVGJR4O","schema_version":"1.0","canonical_sha256":"6b2a64c78e36d241fa7783d6b699e361e895b5a85cec4d6cb094e4646636308d","source":{"kind":"arxiv","id":"2605.24711","version":1},"attestation_state":"computed","paper":{"title":"Covering vertices by sequential stars","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"An Zhang, Guohui Lin, Jiaxuan Ma, Mengyuan Hu, Wei Ding, Yong Chen, Yue Sun, Zhikai Chen","submitted_at":"2026-05-23T19:31:47Z","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"},"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":"2605.24711","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-23T19:31:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"05e32b2d6aaaccdfeb075929cae94e48ad590a4a9e50c456ca7f3802c28ce34e","abstract_canon_sha256":"22fb53b99d49be2e172f48bd8b689c6f7b08b8c32d82b698700d2f4ee7601521"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:54.695868Z","signature_b64":"9oSI4J41CRPbnrCGXFqRgPKPLy25LWIjJo32DvQ7dC0Gm5ucjnTU1RvCPUq7Eu+I6EJ0r7jOH+moOhJWU/J7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b2a64c78e36d241fa7783d6b699e361e895b5a85cec4d6cb094e4646636308d","last_reissued_at":"2026-05-26T01:03:54.694992Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:54.694992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering vertices by sequential stars","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"An Zhang, Guohui Lin, Jiaxuan Ma, Mengyuan Hu, Wei Ding, Yong Chen, Yue Sun, Zhikai Chen","submitted_at":"2026-05-23T19:31:47Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24711","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.24711/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.24711","created_at":"2026-05-26T01:03:54.695142+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.24711v1","created_at":"2026-05-26T01:03:54.695142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24711","created_at":"2026-05-26T01:03:54.695142+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMVGJR4OG3JE","created_at":"2026-05-26T01:03:54.695142+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMVGJR4OG3JED6TX","created_at":"2026-05-26T01:03:54.695142+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMVGJR4O","created_at":"2026-05-26T01:03:54.695142+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/NMVGJR4OG3JED6TXQPLLNGPDMH","json":"https://pith.science/pith/NMVGJR4OG3JED6TXQPLLNGPDMH.json","graph_json":"https://pith.science/api/pith-number/NMVGJR4OG3JED6TXQPLLNGPDMH/graph.json","events_json":"https://pith.science/api/pith-number/NMVGJR4OG3JED6TXQPLLNGPDMH/events.json","paper":"https://pith.science/paper/NMVGJR4O"},"agent_actions":{"view_html":"https://pith.science/pith/NMVGJR4OG3JED6TXQPLLNGPDMH","download_json":"https://pith.science/pith/NMVGJR4OG3JED6TXQPLLNGPDMH.json","view_paper":"https://pith.science/paper/NMVGJR4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.24711&json=true","fetch_graph":"https://pith.science/api/pith-number/NMVGJR4OG3JED6TXQPLLNGPDMH/graph.json","fetch_events":"https://pith.science/api/pith-number/NMVGJR4OG3JED6TXQPLLNGPDMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMVGJR4OG3JED6TXQPLLNGPDMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMVGJR4OG3JED6TXQPLLNGPDMH/action/storage_attestation","attest_author":"https://pith.science/pith/NMVGJR4OG3JED6TXQPLLNGPDMH/action/author_attestation","sign_citation":"https://pith.science/pith/NMVGJR4OG3JED6TXQPLLNGPDMH/action/citation_signature","submit_replication":"https://pith.science/pith/NMVGJR4OG3JED6TXQPLLNGPDMH/action/replication_record"}},"created_at":"2026-05-26T01:03:54.695142+00:00","updated_at":"2026-05-26T01:03:54.695142+00:00"}