{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:B2DVUXSIQ4HETPNKKGWHROQCGH","short_pith_number":"pith:B2DVUXSI","schema_version":"1.0","canonical_sha256":"0e875a5e48870e49bdaa51ac78ba0231ee2a7324974f841154fc268d7118a260","source":{"kind":"arxiv","id":"1108.1036","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1108.1036","created_at":"2026-05-18T04:16:13.187902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1036v1","created_at":"2026-05-18T04:16:13.187902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1036","created_at":"2026-05-18T04:16:13.187902+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2DVUXSIQ4HE","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2DVUXSIQ4HETPNK","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2DVUXSI","created_at":"2026-05-18T12:26:24.575870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH","json":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH.json","graph_json":"https://pith.science/api/pith-number/B2DVUXSIQ4HETPNKKGWHROQCGH/graph.json","events_json":"https://pith.science/api/pith-number/B2DVUXSIQ4HETPNKKGWHROQCGH/events.json","paper":"https://pith.science/paper/B2DVUXSI"},"agent_actions":{"view_html":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH","download_json":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH.json","view_paper":"https://pith.science/paper/B2DVUXSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1036&json=true","fetch_graph":"https://pith.science/api/pith-number/B2DVUXSIQ4HETPNKKGWHROQCGH/graph.json","fetch_events":"https://pith.science/api/pith-number/B2DVUXSIQ4HETPNKKGWHROQCGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/action/storage_attestation","attest_author":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/action/author_attestation","sign_citation":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/action/citation_signature","submit_replication":"https://pith.science/pith/B2DVUXSIQ4HETPNKKGWHROQCGH/action/replication_record"}},"created_at":"2026-05-18T04:16:13.187902+00:00","updated_at":"2026-05-18T04:16:13.187902+00:00"}