{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JLIRM4EESS3TSX6GOA73VZCRCO","short_pith_number":"pith:JLIRM4EE","canonical_record":{"source":{"id":"1610.00636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-03T17:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"ac5822f7fa5a8af82455fb7258b2d642cde00074979b8f966dc482a854c157e7","abstract_canon_sha256":"9cf57b6479acbea05d76532d1b468a55f5add5dc0115603d748b49e0c4649928"},"schema_version":"1.0"},"canonical_sha256":"4ad116708494b7395fc6703fbae45113b0c02a8c0726c4be59ea79d158539323","source":{"kind":"arxiv","id":"1610.00636","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00636","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00636v2","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00636","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"JLIRM4EESS3T","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JLIRM4EESS3TSX6G","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JLIRM4EE","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JLIRM4EESS3TSX6GOA73VZCRCO","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-03T17:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"ac5822f7fa5a8af82455fb7258b2d642cde00074979b8f966dc482a854c157e7","abstract_canon_sha256":"9cf57b6479acbea05d76532d1b468a55f5add5dc0115603d748b49e0c4649928"},"schema_version":"1.0"},"canonical_sha256":"4ad116708494b7395fc6703fbae45113b0c02a8c0726c4be59ea79d158539323","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:33.974271Z","signature_b64":"4RKOEhHH94enPFhDrExN4oVVGSFbFzDomdq/X//TqUUaNGlf+pCn2ugGUIOzzq+Lt3iZJupFBzAquzgG/d0WCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ad116708494b7395fc6703fbae45113b0c02a8c0726c4be59ea79d158539323","last_reissued_at":"2026-05-18T00:52:33.973914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:33.973914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00636","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-18T00:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GqxCJHxkr7QkXBf28o6XSotD1nKbKtGZNhwrJw3m1uX9rOIga+Z/LB0cPgXztlpwPqb82Rdvx+z6sJKKQJqtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:29:57.613976Z"},"content_sha256":"22c3830cec341b123a7b785554bf450b80a15adaf9b9a7ce938a7999542e3635","schema_version":"1.0","event_id":"sha256:22c3830cec341b123a7b785554bf450b80a15adaf9b9a7ce938a7999542e3635"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JLIRM4EESS3TSX6GOA73VZCRCO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Double-critical graph conjecture for claw-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Martin Rolek, Zi-Xia Song","submitted_at":"2016-10-03T17:06:10Z","abstract_excerpt":"A connected graph $G$ with chromatic number $t$ is double-critical if $G \\backslash \\{x, y\\}$ is $(t - 2)$-colorable for each edge $xy \\in E(G)$. The complete graphs are the only known examples of double-critical graphs. A long-standing conjecture of Erd\\H os and Lov\\'asz from 1966, which is referred to as the Double-Critical Graph Conjecture, states that there are no other double-critical graphs. That is, if a graph $G$ with chromatic number $t$ is double-critical, then $G$ is the complete graph on $t$ vertices. This has been verified for $t \\le 5$, but remains open for $t \\ge 6$. In this pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00636","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-18T00:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EmEGNRWJFLGUm79XzYu6Xu+N8iaTrzzgb85bmZVGtZm7qpPNSX2wCxTrPnln+Mao1oOTJI5O92Q+wVSEpQRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:29:57.614349Z"},"content_sha256":"91ec02ad09b0db50683d68c8388f6db4c0d37e6cee890eef09dea5808705cad9","schema_version":"1.0","event_id":"sha256:91ec02ad09b0db50683d68c8388f6db4c0d37e6cee890eef09dea5808705cad9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO/bundle.json","state_url":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLIRM4EESS3TSX6GOA73VZCRCO/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-03T06:29:57Z","links":{"resolver":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO","bundle":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO/bundle.json","state":"https://pith.science/pith/JLIRM4EESS3TSX6GOA73VZCRCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLIRM4EESS3TSX6GOA73VZCRCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JLIRM4EESS3TSX6GOA73VZCRCO","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":"9cf57b6479acbea05d76532d1b468a55f5add5dc0115603d748b49e0c4649928","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-03T17:06:10Z","title_canon_sha256":"ac5822f7fa5a8af82455fb7258b2d642cde00074979b8f966dc482a854c157e7"},"schema_version":"1.0","source":{"id":"1610.00636","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00636","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00636v2","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00636","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"JLIRM4EESS3T","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JLIRM4EESS3TSX6G","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JLIRM4EE","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:91ec02ad09b0db50683d68c8388f6db4c0d37e6cee890eef09dea5808705cad9","target":"graph","created_at":"2026-05-18T00:52:33Z","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 connected graph $G$ with chromatic number $t$ is double-critical if $G \\backslash \\{x, y\\}$ is $(t - 2)$-colorable for each edge $xy \\in E(G)$. The complete graphs are the only known examples of double-critical graphs. A long-standing conjecture of Erd\\H os and Lov\\'asz from 1966, which is referred to as the Double-Critical Graph Conjecture, states that there are no other double-critical graphs. That is, if a graph $G$ with chromatic number $t$ is double-critical, then $G$ is the complete graph on $t$ vertices. This has been verified for $t \\le 5$, but remains open for $t \\ge 6$. In this pap","authors_text":"Martin Rolek, Zi-Xia Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-03T17:06:10Z","title":"Double-critical graph conjecture for claw-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00636","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:22c3830cec341b123a7b785554bf450b80a15adaf9b9a7ce938a7999542e3635","target":"record","created_at":"2026-05-18T00:52:33Z","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":"9cf57b6479acbea05d76532d1b468a55f5add5dc0115603d748b49e0c4649928","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-03T17:06:10Z","title_canon_sha256":"ac5822f7fa5a8af82455fb7258b2d642cde00074979b8f966dc482a854c157e7"},"schema_version":"1.0","source":{"id":"1610.00636","kind":"arxiv","version":2}},"canonical_sha256":"4ad116708494b7395fc6703fbae45113b0c02a8c0726c4be59ea79d158539323","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ad116708494b7395fc6703fbae45113b0c02a8c0726c4be59ea79d158539323","first_computed_at":"2026-05-18T00:52:33.973914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:33.973914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4RKOEhHH94enPFhDrExN4oVVGSFbFzDomdq/X//TqUUaNGlf+pCn2ugGUIOzzq+Lt3iZJupFBzAquzgG/d0WCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:33.974271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00636","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22c3830cec341b123a7b785554bf450b80a15adaf9b9a7ce938a7999542e3635","sha256:91ec02ad09b0db50683d68c8388f6db4c0d37e6cee890eef09dea5808705cad9"],"state_sha256":"24bb5e574f37229ac3fe9aedc6e14d987e466e7b615a0e730d2d3c3ad1cbda43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbAA/jVDMj/lNEphArNbeCiLcmuTCwM/5nm2kvjNTO7LBo2glROS0U3Pxr8jiQkSwJEq8Su10iFom9p0/vDNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:29:57.616298Z","bundle_sha256":"3acabdbb354ae749602973b089b983ae87a18bc890ae4ec206c2656782a512ff"}}