{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RFDXHGDD6WRHJ7G4OP6RM3ET2F","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":"16fefb0b6a5f265654f761eb61405237f3e06d93634ddf7065ea49a6c81d5a6a","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-17T17:46:18Z","title_canon_sha256":"dfd1eca30ffc1ac8ad397f5f07f8af8fbd467b4d3d59ab71a3afdf0ec59b08de"},"schema_version":"1.0","source":{"id":"2411.11136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.11136","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"arxiv_version","alias_value":"2411.11136v1","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11136","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_12","alias_value":"RFDXHGDD6WRH","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_16","alias_value":"RFDXHGDD6WRHJ7G4","created_at":"2026-07-05T09:36:29Z"},{"alias_kind":"pith_short_8","alias_value":"RFDXHGDD","created_at":"2026-07-05T09:36:29Z"}],"graph_snapshots":[{"event_id":"sha256:ae72de20e7cf73837662a3d0679d14c6ef2d0143114fe8821dc2c8a6a6d58a24","target":"graph","created_at":"2026-07-05T09:36:29Z","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/2411.11136/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a positive integer $k \\ge 1$, a $k$-star ($k^+$-star, $k^-$-star, respectively) is a connected graph containing a degree-$\\ell$ vertex and $\\ell$ degree-$1$ vertices, where $\\ell = k$ ($\\ell \\ge k$, $1 \\le \\ell \\le k$, respectively). The $k^+$-star packing problem is to cover as many vertices of an input graph $G$ as possible using vertex-disjoint $k^+$-stars in $G$; and given $k > t \\ge 1$, the $k^-/t$-star packing problem is to cover as many vertices of $G$ as possible using vertex-disjoint $k^-$-stars but no $t$-stars in $G$. Both problems are NP-hard for any fixed $k \\ge 2$. We present","authors_text":"An Zhang, Guohui Lin, Mengyuan Hu, Mingyang Gong, Yong Chen","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-17T17:46:18Z","title":"Approximation algorithms for non-sequential star packing problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11136","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:4b356e6990894342f74af3ce7b9f1d0ae39a0f257985c0d69a8055cb8abe3667","target":"record","created_at":"2026-07-05T09:36:29Z","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":"16fefb0b6a5f265654f761eb61405237f3e06d93634ddf7065ea49a6c81d5a6a","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-17T17:46:18Z","title_canon_sha256":"dfd1eca30ffc1ac8ad397f5f07f8af8fbd467b4d3d59ab71a3afdf0ec59b08de"},"schema_version":"1.0","source":{"id":"2411.11136","kind":"arxiv","version":1}},"canonical_sha256":"8947739863f5a274fcdc73fd166c93d14c29d16907e9620a91792a32ec51f7b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8947739863f5a274fcdc73fd166c93d14c29d16907e9620a91792a32ec51f7b1","first_computed_at":"2026-07-05T09:36:29.164988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:36:29.164988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h6tPO+kXuCwoUQ7rvposIzKWfR/nwqL4gSiGoWM5OBCpxxRi9vC9YrG9bpiz/xThHTAk2kI4QnZbWrQw4dJuCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:36:29.165458Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.11136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b356e6990894342f74af3ce7b9f1d0ae39a0f257985c0d69a8055cb8abe3667","sha256:ae72de20e7cf73837662a3d0679d14c6ef2d0143114fe8821dc2c8a6a6d58a24"],"state_sha256":"527581fc12a901b86f90699b1b28002bebd3f27355ca7ae4f54b92264bd3f183"}