{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GC6NVS3XAGVDVAEDUBIP3TZISE","short_pith_number":"pith:GC6NVS3X","canonical_record":{"source":{"id":"1701.08857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-30T22:27:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6b84e6c1a8167b518e17a042afe451167b9de6cdecfa6378854120dd0d076ab4","abstract_canon_sha256":"9fda0a4a61ff6f279797c38e5043409f93846c3deb0896c1abc95de2565655b9"},"schema_version":"1.0"},"canonical_sha256":"30bcdacb7701aa3a8083a050fdcf289137059ef680de78cd152826cf061acd1e","source":{"kind":"arxiv","id":"1701.08857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08857","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08857v1","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08857","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"GC6NVS3XAGVD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GC6NVS3XAGVDVAED","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GC6NVS3X","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GC6NVS3XAGVDVAEDUBIP3TZISE","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-30T22:27:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6b84e6c1a8167b518e17a042afe451167b9de6cdecfa6378854120dd0d076ab4","abstract_canon_sha256":"9fda0a4a61ff6f279797c38e5043409f93846c3deb0896c1abc95de2565655b9"},"schema_version":"1.0"},"canonical_sha256":"30bcdacb7701aa3a8083a050fdcf289137059ef680de78cd152826cf061acd1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:39.006534Z","signature_b64":"kmCqafDTO01I/G6GbliBwbqmnvEhYyTnT0I9/9xhwpdS50j++umG4U/C4J5gRch17CL9PMkj7/HrbWQ/KULwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30bcdacb7701aa3a8083a050fdcf289137059ef680de78cd152826cf061acd1e","last_reissued_at":"2026-05-18T00:51:39.006120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:39.006120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08857","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-05-18T00:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WvaCoxLbzDJrWkH0eAknHtES+Hs0xfCmg2LtAcTT1ql8GvP4i74ObjKgstJ/01O0ZRs0sTau0xdz69RgQcnrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:18:25.178766Z"},"content_sha256":"6cc7ded39a4a1cb3cbb160254db52d7323ac4dbe68b850a3bba93faddf2977c7","schema_version":"1.0","event_id":"sha256:6cc7ded39a4a1cb3cbb160254db52d7323ac4dbe68b850a3bba93faddf2977c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GC6NVS3XAGVDVAEDUBIP3TZISE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infinitely many minimal classes of graphs of unbounded clique-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"A. Collins, J. Foniok, N. Korpelainen, V. Lozin, V. Zamaraev","submitted_at":"2017-01-30T22:27:19Z","abstract_excerpt":"The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely, the class of planar graphs. In the case of tree-width, the restriction to minor-closed classes is justified by the fact that the tree-width of a graph is never smaller than the tree-width of any of its minors. This, however, is not the case with respect to clique-width, as the clique-width of a graph can be (much) smaller than the clique-width of its minor. On the other hand, the clique-width of a graph is never smal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08857","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":""},"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-05-18T00:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2hNgjxsTkvU7Irq5qwUNFeAaRfeDmwowv7EzckH9n0g3QLrC/XJKrUC6FgZHZokRQpluumpK3k16TX6Y/hqlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:18:25.179118Z"},"content_sha256":"fb80dcfb5ff9fc4ce12abd3214d8e2738c59a3f0a68c61843d5a7167d604827f","schema_version":"1.0","event_id":"sha256:fb80dcfb5ff9fc4ce12abd3214d8e2738c59a3f0a68c61843d5a7167d604827f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GC6NVS3XAGVDVAEDUBIP3TZISE/bundle.json","state_url":"https://pith.science/pith/GC6NVS3XAGVDVAEDUBIP3TZISE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GC6NVS3XAGVDVAEDUBIP3TZISE/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-04T19:18:25Z","links":{"resolver":"https://pith.science/pith/GC6NVS3XAGVDVAEDUBIP3TZISE","bundle":"https://pith.science/pith/GC6NVS3XAGVDVAEDUBIP3TZISE/bundle.json","state":"https://pith.science/pith/GC6NVS3XAGVDVAEDUBIP3TZISE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GC6NVS3XAGVDVAEDUBIP3TZISE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GC6NVS3XAGVDVAEDUBIP3TZISE","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":"9fda0a4a61ff6f279797c38e5043409f93846c3deb0896c1abc95de2565655b9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-30T22:27:19Z","title_canon_sha256":"6b84e6c1a8167b518e17a042afe451167b9de6cdecfa6378854120dd0d076ab4"},"schema_version":"1.0","source":{"id":"1701.08857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08857","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08857v1","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08857","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"GC6NVS3XAGVD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GC6NVS3XAGVDVAED","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GC6NVS3X","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:fb80dcfb5ff9fc4ce12abd3214d8e2738c59a3f0a68c61843d5a7167d604827f","target":"graph","created_at":"2026-05-18T00:51:39Z","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"},"paper":{"abstract_excerpt":"The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely, the class of planar graphs. In the case of tree-width, the restriction to minor-closed classes is justified by the fact that the tree-width of a graph is never smaller than the tree-width of any of its minors. This, however, is not the case with respect to clique-width, as the clique-width of a graph can be (much) smaller than the clique-width of its minor. On the other hand, the clique-width of a graph is never smal","authors_text":"A. Collins, J. Foniok, N. Korpelainen, V. Lozin, V. Zamaraev","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-30T22:27:19Z","title":"Infinitely many minimal classes of graphs of unbounded clique-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08857","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:6cc7ded39a4a1cb3cbb160254db52d7323ac4dbe68b850a3bba93faddf2977c7","target":"record","created_at":"2026-05-18T00:51:39Z","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":"9fda0a4a61ff6f279797c38e5043409f93846c3deb0896c1abc95de2565655b9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-30T22:27:19Z","title_canon_sha256":"6b84e6c1a8167b518e17a042afe451167b9de6cdecfa6378854120dd0d076ab4"},"schema_version":"1.0","source":{"id":"1701.08857","kind":"arxiv","version":1}},"canonical_sha256":"30bcdacb7701aa3a8083a050fdcf289137059ef680de78cd152826cf061acd1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30bcdacb7701aa3a8083a050fdcf289137059ef680de78cd152826cf061acd1e","first_computed_at":"2026-05-18T00:51:39.006120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:39.006120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kmCqafDTO01I/G6GbliBwbqmnvEhYyTnT0I9/9xhwpdS50j++umG4U/C4J5gRch17CL9PMkj7/HrbWQ/KULwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:39.006534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cc7ded39a4a1cb3cbb160254db52d7323ac4dbe68b850a3bba93faddf2977c7","sha256:fb80dcfb5ff9fc4ce12abd3214d8e2738c59a3f0a68c61843d5a7167d604827f"],"state_sha256":"ede0e917e70855e3bf1113b2974698ec7421278c2a55a7189bb558c5f9f70ee3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ap4pChtVjed1OFsGm2eNmZmdSWPP5mOTqeauKMiTydZnIa/Jd+lT9MKLjUTi2P0ICUwonVau2ekIDCywVBtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:18:25.181181Z","bundle_sha256":"23f63b867c0176865441b076a5f67723817acddbb2a47ecccd8f7cf635e393fa"}}