{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:IYR3ZA3D3KIVWCPOILWAJR2HFB","short_pith_number":"pith:IYR3ZA3D","schema_version":"1.0","canonical_sha256":"4623bc8363da915b09ee42ec04c747287126308facbe4fa2c466c7617c10f709","source":{"kind":"arxiv","id":"0907.5138","version":2},"attestation_state":"computed","paper":{"title":"Cutwidth and degeneracy of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Benoit Kloeckner (IF)","submitted_at":"2009-07-29T14:09:22Z","abstract_excerpt":"We prove an inequality involving the degeneracy, the cutwidth and the sparsity of graphs. It implies a quadratic lower bound on the cutwidth in terms of the degeneracy for all graphs and an improvement of it for clique-free graphs."},"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":"0907.5138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-29T14:09:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c7d6a741b22552924dae2e525d2c50c80be7d4f7eb970ca943fe010fea36a775","abstract_canon_sha256":"e6f8081365df4b98a46aeaf789f8bb420407161bc0b44eaec179b320629c1c85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:14.409535Z","signature_b64":"IFdx0J7VXxsSdPliAWRrlGoPlAoHlNlN9nmxtHxkPm6TgdjayAEqzlF47lAk/WFQLZxcvgxYPkwbdSK6ztJNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4623bc8363da915b09ee42ec04c747287126308facbe4fa2c466c7617c10f709","last_reissued_at":"2026-05-18T04:38:14.409040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:14.409040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutwidth and degeneracy of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Benoit Kloeckner (IF)","submitted_at":"2009-07-29T14:09:22Z","abstract_excerpt":"We prove an inequality involving the degeneracy, the cutwidth and the sparsity of graphs. It implies a quadratic lower bound on the cutwidth in terms of the degeneracy for all graphs and an improvement of it for clique-free graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.5138","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0907.5138","created_at":"2026-05-18T04:38:14.409113+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.5138v2","created_at":"2026-05-18T04:38:14.409113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.5138","created_at":"2026-05-18T04:38:14.409113+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYR3ZA3D3KIV","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYR3ZA3D3KIVWCPO","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYR3ZA3D","created_at":"2026-05-18T12:26:00.592388+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/IYR3ZA3D3KIVWCPOILWAJR2HFB","json":"https://pith.science/pith/IYR3ZA3D3KIVWCPOILWAJR2HFB.json","graph_json":"https://pith.science/api/pith-number/IYR3ZA3D3KIVWCPOILWAJR2HFB/graph.json","events_json":"https://pith.science/api/pith-number/IYR3ZA3D3KIVWCPOILWAJR2HFB/events.json","paper":"https://pith.science/paper/IYR3ZA3D"},"agent_actions":{"view_html":"https://pith.science/pith/IYR3ZA3D3KIVWCPOILWAJR2HFB","download_json":"https://pith.science/pith/IYR3ZA3D3KIVWCPOILWAJR2HFB.json","view_paper":"https://pith.science/paper/IYR3ZA3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.5138&json=true","fetch_graph":"https://pith.science/api/pith-number/IYR3ZA3D3KIVWCPOILWAJR2HFB/graph.json","fetch_events":"https://pith.science/api/pith-number/IYR3ZA3D3KIVWCPOILWAJR2HFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYR3ZA3D3KIVWCPOILWAJR2HFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYR3ZA3D3KIVWCPOILWAJR2HFB/action/storage_attestation","attest_author":"https://pith.science/pith/IYR3ZA3D3KIVWCPOILWAJR2HFB/action/author_attestation","sign_citation":"https://pith.science/pith/IYR3ZA3D3KIVWCPOILWAJR2HFB/action/citation_signature","submit_replication":"https://pith.science/pith/IYR3ZA3D3KIVWCPOILWAJR2HFB/action/replication_record"}},"created_at":"2026-05-18T04:38:14.409113+00:00","updated_at":"2026-05-18T04:38:14.409113+00:00"}