{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CZFYDMTVWDKHLVMUCAZ2YLPEDQ","short_pith_number":"pith:CZFYDMTV","canonical_record":{"source":{"id":"1312.2086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-07T11:11:34Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"0e9b689d44e69c40d5e2e4012dc2181d1c260108831d8d8935c6f92f745d8d82","abstract_canon_sha256":"783e0815b746d58201c1f03547cdde7d76b58fca90679de91ff8ce1917b47bd2"},"schema_version":"1.0"},"canonical_sha256":"164b81b275b0d475d5941033ac2de41c0ab51032e8b388762c9a3438fb4ff5b4","source":{"kind":"arxiv","id":"1312.2086","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2086","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2086v2","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2086","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"CZFYDMTVWDKH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CZFYDMTVWDKHLVMU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CZFYDMTV","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CZFYDMTVWDKHLVMUCAZ2YLPEDQ","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-07T11:11:34Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"0e9b689d44e69c40d5e2e4012dc2181d1c260108831d8d8935c6f92f745d8d82","abstract_canon_sha256":"783e0815b746d58201c1f03547cdde7d76b58fca90679de91ff8ce1917b47bd2"},"schema_version":"1.0"},"canonical_sha256":"164b81b275b0d475d5941033ac2de41c0ab51032e8b388762c9a3438fb4ff5b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:00.945190Z","signature_b64":"/1iE133BLM6gha5JicQbh/F9769NaKT7aCkV5BWggFtaKVgBCYJGdCkfBlEICCPQQo7fMPvboHVR39ANAvtdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"164b81b275b0d475d5941033ac2de41c0ab51032e8b388762c9a3438fb4ff5b4","last_reissued_at":"2026-05-18T03:05:00.944558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:00.944558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2086","source_version":2,"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-18T03:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/5nNwVvQwGV54ppAkiHT/sudZPsGdWg0tSg7hCab/zkcOtQTU5MHvFmR4F0+VRCX4Hp6cKS0DTP7og47+WuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:32:52.323484Z"},"content_sha256":"05e97694b2b8c895183fc6c162f0909e68e65292f9e89d9b4a1ef1cdfbfcf619","schema_version":"1.0","event_id":"sha256:05e97694b2b8c895183fc6c162f0909e68e65292f9e89d9b4a1ef1cdfbfcf619"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CZFYDMTVWDKHLVMUCAZ2YLPEDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Celina M. H. de Figueiredo, H\\'elio B. Mac\\^edo Filho, Raphael C. S. Machado","submitted_at":"2013-12-07T11:11:34Z","abstract_excerpt":"A clique of a graph is a maximal set of vertices of size at least 2 that induces a complete graph. A $k$-clique-colouring of a graph is a colouring of the vertices with at most $k$ colours such that no clique is monochromatic. D\\'efossez proved that the 2-clique-colouring of perfect graphs is a $\\Sigma_2^P$-complete problem [J. Graph Theory 62 (2009) 139--156]. We strengthen this result by showing that it is still $\\Sigma_2^P$-complete for weakly chordal graphs. We then determine a hierarchy of nested subclasses of weakly chordal graphs whereby each graph class is in a distinct complexity clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2086","kind":"arxiv","version":2},"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-18T03:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zlsi6qicDS4uCjPWHbvaQk+tq36wZOY9kgqxewdxcen1HfjJhCM9SeU/eLuRV+vf/Vz+mXBI3PAQsWGixLlNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:32:52.323828Z"},"content_sha256":"af11985af636c3b7aee8060dba3814b760b40cd152e213e25bd9ec07a747ac32","schema_version":"1.0","event_id":"sha256:af11985af636c3b7aee8060dba3814b760b40cd152e213e25bd9ec07a747ac32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZFYDMTVWDKHLVMUCAZ2YLPEDQ/bundle.json","state_url":"https://pith.science/pith/CZFYDMTVWDKHLVMUCAZ2YLPEDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZFYDMTVWDKHLVMUCAZ2YLPEDQ/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-24T15:32:52Z","links":{"resolver":"https://pith.science/pith/CZFYDMTVWDKHLVMUCAZ2YLPEDQ","bundle":"https://pith.science/pith/CZFYDMTVWDKHLVMUCAZ2YLPEDQ/bundle.json","state":"https://pith.science/pith/CZFYDMTVWDKHLVMUCAZ2YLPEDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZFYDMTVWDKHLVMUCAZ2YLPEDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CZFYDMTVWDKHLVMUCAZ2YLPEDQ","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":"783e0815b746d58201c1f03547cdde7d76b58fca90679de91ff8ce1917b47bd2","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-07T11:11:34Z","title_canon_sha256":"0e9b689d44e69c40d5e2e4012dc2181d1c260108831d8d8935c6f92f745d8d82"},"schema_version":"1.0","source":{"id":"1312.2086","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2086","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2086v2","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2086","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"CZFYDMTVWDKH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CZFYDMTVWDKHLVMU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CZFYDMTV","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:af11985af636c3b7aee8060dba3814b760b40cd152e213e25bd9ec07a747ac32","target":"graph","created_at":"2026-05-18T03:05:00Z","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":"A clique of a graph is a maximal set of vertices of size at least 2 that induces a complete graph. A $k$-clique-colouring of a graph is a colouring of the vertices with at most $k$ colours such that no clique is monochromatic. D\\'efossez proved that the 2-clique-colouring of perfect graphs is a $\\Sigma_2^P$-complete problem [J. Graph Theory 62 (2009) 139--156]. We strengthen this result by showing that it is still $\\Sigma_2^P$-complete for weakly chordal graphs. We then determine a hierarchy of nested subclasses of weakly chordal graphs whereby each graph class is in a distinct complexity clas","authors_text":"Celina M. H. de Figueiredo, H\\'elio B. Mac\\^edo Filho, Raphael C. S. Machado","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-07T11:11:34Z","title":"Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2086","kind":"arxiv","version":2},"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:05e97694b2b8c895183fc6c162f0909e68e65292f9e89d9b4a1ef1cdfbfcf619","target":"record","created_at":"2026-05-18T03:05:00Z","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":"783e0815b746d58201c1f03547cdde7d76b58fca90679de91ff8ce1917b47bd2","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-07T11:11:34Z","title_canon_sha256":"0e9b689d44e69c40d5e2e4012dc2181d1c260108831d8d8935c6f92f745d8d82"},"schema_version":"1.0","source":{"id":"1312.2086","kind":"arxiv","version":2}},"canonical_sha256":"164b81b275b0d475d5941033ac2de41c0ab51032e8b388762c9a3438fb4ff5b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"164b81b275b0d475d5941033ac2de41c0ab51032e8b388762c9a3438fb4ff5b4","first_computed_at":"2026-05-18T03:05:00.944558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:00.944558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/1iE133BLM6gha5JicQbh/F9769NaKT7aCkV5BWggFtaKVgBCYJGdCkfBlEICCPQQo7fMPvboHVR39ANAvtdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:00.945190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2086","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05e97694b2b8c895183fc6c162f0909e68e65292f9e89d9b4a1ef1cdfbfcf619","sha256:af11985af636c3b7aee8060dba3814b760b40cd152e213e25bd9ec07a747ac32"],"state_sha256":"9feb37ff9d35624e78ffadbba085b84149ed00362f84af448628871e9a7602ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BSMcya7w1IvMu40BiAyxG0oOdjJBIeBB4a3fI4jaqHd/wEfUApjyaxqOAxFrlyHPqKN81RXDjxIE48jE/N1KBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T15:32:52.325882Z","bundle_sha256":"2b7a2a5e49c27cd15d75f4a550f344114cf3e3318e10cd3cfcdcd431f28c3d18"}}