{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7RJUSJBIJG7I4HOVBWBCA6QSNX","short_pith_number":"pith:7RJUSJBI","canonical_record":{"source":{"id":"2606.17307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-15T21:24:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1ec163171ddbd5a4347af929553f1b390079772444b52eb17ff6808b88e586a","abstract_canon_sha256":"2b17f0a60b7d27c0b67e90ff5754de0eaf697a2c07e6197c430475a0420ec735"},"schema_version":"1.0"},"canonical_sha256":"fc5349242849be8e1dd50d82207a126dc7d2788dd6efe4c6e7d8a026a3e0e8c5","source":{"kind":"arxiv","id":"2606.17307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17307","created_at":"2026-06-19T16:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17307v1","created_at":"2026-06-19T16:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17307","created_at":"2026-06-19T16:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"7RJUSJBIJG7I","created_at":"2026-06-19T16:10:08Z"},{"alias_kind":"pith_short_16","alias_value":"7RJUSJBIJG7I4HOV","created_at":"2026-06-19T16:10:08Z"},{"alias_kind":"pith_short_8","alias_value":"7RJUSJBI","created_at":"2026-06-19T16:10:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7RJUSJBIJG7I4HOVBWBCA6QSNX","target":"record","payload":{"canonical_record":{"source":{"id":"2606.17307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-15T21:24:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1ec163171ddbd5a4347af929553f1b390079772444b52eb17ff6808b88e586a","abstract_canon_sha256":"2b17f0a60b7d27c0b67e90ff5754de0eaf697a2c07e6197c430475a0420ec735"},"schema_version":"1.0"},"canonical_sha256":"fc5349242849be8e1dd50d82207a126dc7d2788dd6efe4c6e7d8a026a3e0e8c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:08.666808Z","signature_b64":"uCF+fI4p2fpvdI+fs54tzs1rKIWk8/WDf9n08IKR5N8uEbXk0agWG4OPZBcpjchFYcDHHgcCX62RVoad/NqCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc5349242849be8e1dd50d82207a126dc7d2788dd6efe4c6e7d8a026a3e0e8c5","last_reissued_at":"2026-06-19T16:10:08.666445Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:08.666445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.17307","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-06-19T16:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2aN++TBY1aP3K3j2YRbx2Z6RYHO/QhJN48fW7hwaY7YkmmDKZCQddtjVrHmqu97XB39eFIu9Ggw8RHgqldduBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:12:58.031193Z"},"content_sha256":"12d1e65d53d577143bb618ff42f19f2ffb611f18ae964ce21939a2d4383b42fe","schema_version":"1.0","event_id":"sha256:12d1e65d53d577143bb618ff42f19f2ffb611f18ae964ce21939a2d4383b42fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7RJUSJBIJG7I4HOVBWBCA6QSNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A program to find families of graphs in Free$\\{C_4,4K_1\\}$ with bounded clique width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Talon, Cl\\'eoph\\'ee Robin","submitted_at":"2026-06-15T21:24:02Z","abstract_excerpt":"In this paper we study the class of graphs without cycles of size 4 and independent sets of size 4 as induced subgraphs: $\\mathop{Free}\\{C_4, 4K_1\\}$. This is one of the three minimal minimal open cases for the complexity of the colouring problem when restricted to classes defined by excluding induced subgraphs of order 4. We investigate the clique width of some subclasses of $\\mathop{Free}\\{C_4, 4K_1\\}$.\n  We introduce a new framework: the $(k,l,m)$-decomposition and prove that if all the graphs of a class $\\cal G$ are $(k,l,m)$-decomposable, then graphs in $\\cal G$ have bounded clique width."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17307","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.17307/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-06-19T16:10:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uoyaxqAP08pUnJCWPLeWBq/VKzPpWH8Tt/PBDmhvB3r5mzYuShKhl8L+IfwnHAGDjvyJYCJ+wW/yyb80dMlRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:12:58.031574Z"},"content_sha256":"3557b7f6b4d0506fdf0172edcfb745091790428f9e27dcbde7aee9304aeb618c","schema_version":"1.0","event_id":"sha256:3557b7f6b4d0506fdf0172edcfb745091790428f9e27dcbde7aee9304aeb618c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RJUSJBIJG7I4HOVBWBCA6QSNX/bundle.json","state_url":"https://pith.science/pith/7RJUSJBIJG7I4HOVBWBCA6QSNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RJUSJBIJG7I4HOVBWBCA6QSNX/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-06-26T14:12:58Z","links":{"resolver":"https://pith.science/pith/7RJUSJBIJG7I4HOVBWBCA6QSNX","bundle":"https://pith.science/pith/7RJUSJBIJG7I4HOVBWBCA6QSNX/bundle.json","state":"https://pith.science/pith/7RJUSJBIJG7I4HOVBWBCA6QSNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RJUSJBIJG7I4HOVBWBCA6QSNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7RJUSJBIJG7I4HOVBWBCA6QSNX","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":"2b17f0a60b7d27c0b67e90ff5754de0eaf697a2c07e6197c430475a0420ec735","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-15T21:24:02Z","title_canon_sha256":"d1ec163171ddbd5a4347af929553f1b390079772444b52eb17ff6808b88e586a"},"schema_version":"1.0","source":{"id":"2606.17307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17307","created_at":"2026-06-19T16:10:08Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17307v1","created_at":"2026-06-19T16:10:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17307","created_at":"2026-06-19T16:10:08Z"},{"alias_kind":"pith_short_12","alias_value":"7RJUSJBIJG7I","created_at":"2026-06-19T16:10:08Z"},{"alias_kind":"pith_short_16","alias_value":"7RJUSJBIJG7I4HOV","created_at":"2026-06-19T16:10:08Z"},{"alias_kind":"pith_short_8","alias_value":"7RJUSJBI","created_at":"2026-06-19T16:10:08Z"}],"graph_snapshots":[{"event_id":"sha256:3557b7f6b4d0506fdf0172edcfb745091790428f9e27dcbde7aee9304aeb618c","target":"graph","created_at":"2026-06-19T16:10:08Z","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.17307/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we study the class of graphs without cycles of size 4 and independent sets of size 4 as induced subgraphs: $\\mathop{Free}\\{C_4, 4K_1\\}$. This is one of the three minimal minimal open cases for the complexity of the colouring problem when restricted to classes defined by excluding induced subgraphs of order 4. We investigate the clique width of some subclasses of $\\mathop{Free}\\{C_4, 4K_1\\}$.\n  We introduce a new framework: the $(k,l,m)$-decomposition and prove that if all the graphs of a class $\\cal G$ are $(k,l,m)$-decomposable, then graphs in $\\cal G$ have bounded clique width.","authors_text":"Alexandre Talon, Cl\\'eoph\\'ee Robin","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-15T21:24:02Z","title":"A program to find families of graphs in Free$\\{C_4,4K_1\\}$ with bounded clique width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17307","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:12d1e65d53d577143bb618ff42f19f2ffb611f18ae964ce21939a2d4383b42fe","target":"record","created_at":"2026-06-19T16:10:08Z","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":"2b17f0a60b7d27c0b67e90ff5754de0eaf697a2c07e6197c430475a0420ec735","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-15T21:24:02Z","title_canon_sha256":"d1ec163171ddbd5a4347af929553f1b390079772444b52eb17ff6808b88e586a"},"schema_version":"1.0","source":{"id":"2606.17307","kind":"arxiv","version":1}},"canonical_sha256":"fc5349242849be8e1dd50d82207a126dc7d2788dd6efe4c6e7d8a026a3e0e8c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc5349242849be8e1dd50d82207a126dc7d2788dd6efe4c6e7d8a026a3e0e8c5","first_computed_at":"2026-06-19T16:10:08.666445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:08.666445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uCF+fI4p2fpvdI+fs54tzs1rKIWk8/WDf9n08IKR5N8uEbXk0agWG4OPZBcpjchFYcDHHgcCX62RVoad/NqCBw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:08.666808Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.17307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12d1e65d53d577143bb618ff42f19f2ffb611f18ae964ce21939a2d4383b42fe","sha256:3557b7f6b4d0506fdf0172edcfb745091790428f9e27dcbde7aee9304aeb618c"],"state_sha256":"17381cd2bf3b9bc11b4b4fc0d9a8075316a873d0b7d1e3c4f597aec739053518"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3DAteOMIBFH74h3taQZvRovCBRtXwAYQybcYlgvNMvOkevxom6DISaC+7m3OgI9QJJPWErygFQiu3EeMNAlqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:12:58.033572Z","bundle_sha256":"1abf83f3b874a7bc62c2fc59f73ff28ca9d53b8d32d957c58b56bdf78e498d4e"}}