{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2BIHSWU6JOCO7A5VEFOLYLCRTZ","short_pith_number":"pith:2BIHSWU6","canonical_record":{"source":{"id":"2606.31873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T15:57:21Z","cross_cats_sorted":[],"title_canon_sha256":"a67f3ff508c520c698898a73109ed936b095e3ac8b4610d57cd18c5872df0b96","abstract_canon_sha256":"f3c9c12f2ef6771cce35aca8e414abc015bc653ac1c40cfc5daea500d6efa5df"},"schema_version":"1.0"},"canonical_sha256":"d050795a9e4b84ef83b5215cbc2c519e701e78abea5d59761f3ca653cf83fed7","source":{"kind":"arxiv","id":"2606.31873","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2BIHSWU6JOCO7A5VEFOLYLCRTZ","target":"record","payload":{"canonical_record":{"source":{"id":"2606.31873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-30T15:57:21Z","cross_cats_sorted":[],"title_canon_sha256":"a67f3ff508c520c698898a73109ed936b095e3ac8b4610d57cd18c5872df0b96","abstract_canon_sha256":"f3c9c12f2ef6771cce35aca8e414abc015bc653ac1c40cfc5daea500d6efa5df"},"schema_version":"1.0"},"canonical_sha256":"d050795a9e4b84ef83b5215cbc2c519e701e78abea5d59761f3ca653cf83fed7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:18.151791Z","signature_b64":"h0c8nI4pbewyMEq9p+OgpcEF5FAYjLeZX2Ss0a0RKSXuZ7YEPYRNEAoiTHxHiGPx/XAcr82MtP0tZvmq+AGlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d050795a9e4b84ef83b5215cbc2c519e701e78abea5d59761f3ca653cf83fed7","last_reissued_at":"2026-07-01T01:18:18.151164Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:18.151164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.31873","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-01T01:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aC8eEmVLFr4fV+V1TREvcxCYAW9A6sz0NGKjoBUUKAC8l2xdpdqFQmgt6JauxNDh932rMUDGNSaNq7tSCplDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T02:13:08.296664Z"},"content_sha256":"15e640a722b500ce6636deb0e58c1e54011280f399ca450cc3900d23d80f4319","schema_version":"1.0","event_id":"sha256:15e640a722b500ce6636deb0e58c1e54011280f399ca450cc3900d23d80f4319"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2BIHSWU6JOCO7A5VEFOLYLCRTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight bounds for clique-packing parameterized by clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Narek Bojikian, Stefan Kratsch","submitted_at":"2026-06-30T15:57:21Z","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$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31873","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/2606.31873/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-01T01:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7zN1dBkALI1HMrjYl5WyspcFfD6e9Q0pGFW3dqs87wOyuwlwlxnnHz3Cs5RCjiTSMWff8niVt9YaPHv1KQ1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T02:13:08.297389Z"},"content_sha256":"c4beef531a6576858407ee76e5fca8db13db9570a67c28995525a2e5673d762d","schema_version":"1.0","event_id":"sha256:c4beef531a6576858407ee76e5fca8db13db9570a67c28995525a2e5673d762d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BIHSWU6JOCO7A5VEFOLYLCRTZ/bundle.json","state_url":"https://pith.science/pith/2BIHSWU6JOCO7A5VEFOLYLCRTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BIHSWU6JOCO7A5VEFOLYLCRTZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-13T02:13:08Z","links":{"resolver":"https://pith.science/pith/2BIHSWU6JOCO7A5VEFOLYLCRTZ","bundle":"https://pith.science/pith/2BIHSWU6JOCO7A5VEFOLYLCRTZ/bundle.json","state":"https://pith.science/pith/2BIHSWU6JOCO7A5VEFOLYLCRTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BIHSWU6JOCO7A5VEFOLYLCRTZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRRLGXiOsJdnnz6MKtnJdblgb6XYETdFaq882bCgYHxfY1WSWc2JOX7w4+9wrhrC9NtGHQ/BOZbx0xycUTTXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T02:13:08.304176Z","bundle_sha256":"d06957f09876c2f8b3d47605a04a39edba1a352fe913e5e1aa922529f96ee6ca"}}