{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:B2DVUXSIQ4HETPNKKGWHROQCGH","short_pith_number":"pith:B2DVUXSI","canonical_record":{"source":{"id":"1108.1036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-04T10:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"b6a423d7f0a6bebd2b7d4aa07196f6ed6009617f2e05b6f64a9fa435ff655bfb","abstract_canon_sha256":"12e7e36313ca6f53259d456017b8e2e8b00b250552b310113ccafd6e4fc257d8"},"schema_version":"1.0"},"canonical_sha256":"0e875a5e48870e49bdaa51ac78ba0231ee2a7324974f841154fc268d7118a260","source":{"kind":"arxiv","id":"1108.1036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1036","created_at":"2026-05-18T04:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1036v1","created_at":"2026-05-18T04:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1036","created_at":"2026-05-18T04:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"B2DVUXSIQ4HE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"B2DVUXSIQ4HETPNK","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"B2DVUXSI","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:B2DVUXSIQ4HETPNKKGWHROQCGH","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-04T10:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"b6a423d7f0a6bebd2b7d4aa07196f6ed6009617f2e05b6f64a9fa435ff655bfb","abstract_canon_sha256":"12e7e36313ca6f53259d456017b8e2e8b00b250552b310113ccafd6e4fc257d8"},"schema_version":"1.0"},"canonical_sha256":"0e875a5e48870e49bdaa51ac78ba0231ee2a7324974f841154fc268d7118a260","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:13.188537Z","signature_b64":"dif0junQXYxzdx21YPPBRXWzFzv0HKnr1slSHJZzYREdOVQyLxkgh+n0bmJdkiLKpxl4+g5UopMdLI9KXWuEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e875a5e48870e49bdaa51ac78ba0231ee2a7324974f841154fc268d7118a260","last_reissued_at":"2026-05-18T04:16:13.187773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:13.187773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1036","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-18T04:16:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghWhJLIQe4KUmkB9CbdthXv7Z+ekQ5kP8AhovofcQH5ULnlEsSa0vroiKIDsq1KKJ9sm9RUkWDJ0ialXAQSaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:08:50.188435Z"},"content_sha256":"ac3df4e0fb6f42e1d31e6430c284cd4c739f01deda290651610b91e795dec9a2","schema_version":"1.0","event_id":"sha256:ac3df4e0fb6f42e1d31e6430c284cd4c739f01deda290651610b91e795dec9a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:B2DVUXSIQ4HETPNKKGWHROQCGH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On graphs double-critical with respect to the colouring number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Sune Pedersen, Matthias Kriesell","submitted_at":"2011-08-04T10:10:35Z","abstract_excerpt":"The colouring number col(G) of a graph G is the smallest integer k for which there is an ordering of the vertices of G such that when removing the vertices of G in the specified order no vertex of degree more than k-1 in the remaining graph is removed at any step. An edge e of a graph G is said to be double-col-critical if the colouring number of G-V(e) is at most the colouring number of G minus 2. A connected graph G is said to be double-col-critical if each edge of G is double-col-critical. We characterise the double-col-critical graphs with colouring number at most 5. In addition, we prove "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1036","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-18T04:16:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S7SKhbbJG5d/HeNtOilKhKvxfTqeUJdxLkFutkOJsYDpTzYeq3I6tS4FzCF0Nr8EU2D5yGmxuybyMlZOpFucAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:08:50.189078Z"},"content_sha256":"a7fa236862e9966a36b401aace8320d5b16c287f37baae622667f47ca0dfebbb","schema_version":"1.0","event_id":"sha256:a7fa236862e9966a36b401aace8320d5b16c287f37baae622667f47ca0dfebbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/bundle.json","state_url":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/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-08T03:08:50Z","links":{"resolver":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH","bundle":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/bundle.json","state":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:B2DVUXSIQ4HETPNKKGWHROQCGH","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":"12e7e36313ca6f53259d456017b8e2e8b00b250552b310113ccafd6e4fc257d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-04T10:10:35Z","title_canon_sha256":"b6a423d7f0a6bebd2b7d4aa07196f6ed6009617f2e05b6f64a9fa435ff655bfb"},"schema_version":"1.0","source":{"id":"1108.1036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1036","created_at":"2026-05-18T04:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1036v1","created_at":"2026-05-18T04:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1036","created_at":"2026-05-18T04:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"B2DVUXSIQ4HE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"B2DVUXSIQ4HETPNK","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"B2DVUXSI","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:a7fa236862e9966a36b401aace8320d5b16c287f37baae622667f47ca0dfebbb","target":"graph","created_at":"2026-05-18T04:16:13Z","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 colouring number col(G) of a graph G is the smallest integer k for which there is an ordering of the vertices of G such that when removing the vertices of G in the specified order no vertex of degree more than k-1 in the remaining graph is removed at any step. An edge e of a graph G is said to be double-col-critical if the colouring number of G-V(e) is at most the colouring number of G minus 2. A connected graph G is said to be double-col-critical if each edge of G is double-col-critical. We characterise the double-col-critical graphs with colouring number at most 5. In addition, we prove ","authors_text":"Anders Sune Pedersen, Matthias Kriesell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-04T10:10:35Z","title":"On graphs double-critical with respect to the colouring number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1036","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:ac3df4e0fb6f42e1d31e6430c284cd4c739f01deda290651610b91e795dec9a2","target":"record","created_at":"2026-05-18T04:16:13Z","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":"12e7e36313ca6f53259d456017b8e2e8b00b250552b310113ccafd6e4fc257d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-04T10:10:35Z","title_canon_sha256":"b6a423d7f0a6bebd2b7d4aa07196f6ed6009617f2e05b6f64a9fa435ff655bfb"},"schema_version":"1.0","source":{"id":"1108.1036","kind":"arxiv","version":1}},"canonical_sha256":"0e875a5e48870e49bdaa51ac78ba0231ee2a7324974f841154fc268d7118a260","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e875a5e48870e49bdaa51ac78ba0231ee2a7324974f841154fc268d7118a260","first_computed_at":"2026-05-18T04:16:13.187773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:13.187773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dif0junQXYxzdx21YPPBRXWzFzv0HKnr1slSHJZzYREdOVQyLxkgh+n0bmJdkiLKpxl4+g5UopMdLI9KXWuEBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:13.188537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac3df4e0fb6f42e1d31e6430c284cd4c739f01deda290651610b91e795dec9a2","sha256:a7fa236862e9966a36b401aace8320d5b16c287f37baae622667f47ca0dfebbb"],"state_sha256":"f0142840b06b0a93bcc5cf6a6e0ad07aa1179f7a4156e8758667074bd6c7747b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AG8w4XlVkpLkN73k+TpmyuzWvI0corijo0nGguA/pSW9xndtNBO3RU6VYTiYtpZ6SmMZYzIU6+ThbZ1dkQR7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:08:50.192647Z","bundle_sha256":"cf57a2f69336ba7e55f0bacf885ddf184bf268a2529797d88c97076e9fbc5022"}}