{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2BIHSWU6JOCO7A5VEFOLYLCRTZ","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":"f3c9c12f2ef6771cce35aca8e414abc015bc653ac1c40cfc5daea500d6efa5df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T15:57:21Z","title_canon_sha256":"a67f3ff508c520c698898a73109ed936b095e3ac8b4610d57cd18c5872df0b96"},"schema_version":"1.0","source":{"id":"2606.31873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31873","created_at":"2026-07-01T01:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31873v1","created_at":"2026-07-01T01:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31873","created_at":"2026-07-01T01:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"2BIHSWU6JOCO","created_at":"2026-07-01T01:18:18Z"},{"alias_kind":"pith_short_16","alias_value":"2BIHSWU6JOCO7A5V","created_at":"2026-07-01T01:18:18Z"},{"alias_kind":"pith_short_8","alias_value":"2BIHSWU6","created_at":"2026-07-01T01:18:18Z"}],"graph_snapshots":[{"event_id":"sha256:c4beef531a6576858407ee76e5fca8db13db9570a67c28995525a2e5673d762d","target":"graph","created_at":"2026-07-01T01:18:18Z","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.31873/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the $d$-Clique Packing problem, given a graph $G$ and an integer $t$, we need to decide whether $G$ contains a set of $t$ pairwise vertex-disjoint cliques of size $d$ each. This generalizes Triangle Packing and it is NP-complete for all $d\\geq 3$. For each such $d$, we show how to solve the problem in $n^{O(k^{d-1})}$ time where $k$ is the clique-width of the graph (with a $k$-expression of $G$ given in the input). We complement this by showing that, assuming the Exponential-Time Hypothesis (ETH), there is no algorithm that solves the problem in $n^{o(k^{d-1})}$ time for any fixed $d\\geq 3$","authors_text":"Narek Bojikian, Stefan Kratsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T15:57:21Z","title":"Tight bounds for clique-packing parameterized by clique-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31873","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:15e640a722b500ce6636deb0e58c1e54011280f399ca450cc3900d23d80f4319","target":"record","created_at":"2026-07-01T01:18:18Z","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":"f3c9c12f2ef6771cce35aca8e414abc015bc653ac1c40cfc5daea500d6efa5df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T15:57:21Z","title_canon_sha256":"a67f3ff508c520c698898a73109ed936b095e3ac8b4610d57cd18c5872df0b96"},"schema_version":"1.0","source":{"id":"2606.31873","kind":"arxiv","version":1}},"canonical_sha256":"d050795a9e4b84ef83b5215cbc2c519e701e78abea5d59761f3ca653cf83fed7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d050795a9e4b84ef83b5215cbc2c519e701e78abea5d59761f3ca653cf83fed7","first_computed_at":"2026-07-01T01:18:18.151164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:18:18.151164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h0c8nI4pbewyMEq9p+OgpcEF5FAYjLeZX2Ss0a0RKSXuZ7YEPYRNEAoiTHxHiGPx/XAcr82MtP0tZvmq+AGlAg==","signature_status":"signed_v1","signed_at":"2026-07-01T01:18:18.151791Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.31873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15e640a722b500ce6636deb0e58c1e54011280f399ca450cc3900d23d80f4319","sha256:c4beef531a6576858407ee76e5fca8db13db9570a67c28995525a2e5673d762d"],"state_sha256":"0a659741bba78985885185b43b8c8060aaf93c531f5bdcecfbcd65a32a79a262"}