{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MVM2MGSBA6HBQZJIAOLEJKGSIX","short_pith_number":"pith:MVM2MGSB","schema_version":"1.0","canonical_sha256":"6559a61a41078e186528039644a8d245db7249cde6ad95f93489153e7759e6c3","source":{"kind":"arxiv","id":"1109.1602","version":1},"attestation_state":"computed","paper":{"title":"Nordhaus-Gaddum for Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, Gwena\\\"el Joret","submitted_at":"2011-09-07T23:22:26Z","abstract_excerpt":"We prove that for every graph $G$ with $n$ vertices, the treewidth of $G$ plus the treewidth of the complement of $G$ is at least $n-2$. This bound is tight."},"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":"1109.1602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-07T23:22:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"aee7781a90896fdc8e68b6fd4b48355bc9bc342906a7e52c0ef16ad841c64313","abstract_canon_sha256":"376c23c85437702c75944f16ed14f335c6776db8ccb28b8972b00147e0954f22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:57.109300Z","signature_b64":"PH+GMwirEnitx+Qgs1ZPXtase5aRP7i8sRFPOXNnhbaJFciqyZixQdxqkUmTxJYDPh3Ggt4v57K9HW98lCBNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6559a61a41078e186528039644a8d245db7249cde6ad95f93489153e7759e6c3","last_reissued_at":"2026-05-18T03:20:57.108556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:57.108556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nordhaus-Gaddum for Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, Gwena\\\"el Joret","submitted_at":"2011-09-07T23:22:26Z","abstract_excerpt":"We prove that for every graph $G$ with $n$ vertices, the treewidth of $G$ plus the treewidth of the complement of $G$ is at least $n-2$. This bound is tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1602","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":"1109.1602","created_at":"2026-05-18T03:20:57.108671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.1602v1","created_at":"2026-05-18T03:20:57.108671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1602","created_at":"2026-05-18T03:20:57.108671+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVM2MGSBA6HB","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVM2MGSBA6HBQZJI","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVM2MGSB","created_at":"2026-05-18T12:26:37.096874+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/MVM2MGSBA6HBQZJIAOLEJKGSIX","json":"https://pith.science/pith/MVM2MGSBA6HBQZJIAOLEJKGSIX.json","graph_json":"https://pith.science/api/pith-number/MVM2MGSBA6HBQZJIAOLEJKGSIX/graph.json","events_json":"https://pith.science/api/pith-number/MVM2MGSBA6HBQZJIAOLEJKGSIX/events.json","paper":"https://pith.science/paper/MVM2MGSB"},"agent_actions":{"view_html":"https://pith.science/pith/MVM2MGSBA6HBQZJIAOLEJKGSIX","download_json":"https://pith.science/pith/MVM2MGSBA6HBQZJIAOLEJKGSIX.json","view_paper":"https://pith.science/paper/MVM2MGSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.1602&json=true","fetch_graph":"https://pith.science/api/pith-number/MVM2MGSBA6HBQZJIAOLEJKGSIX/graph.json","fetch_events":"https://pith.science/api/pith-number/MVM2MGSBA6HBQZJIAOLEJKGSIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVM2MGSBA6HBQZJIAOLEJKGSIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVM2MGSBA6HBQZJIAOLEJKGSIX/action/storage_attestation","attest_author":"https://pith.science/pith/MVM2MGSBA6HBQZJIAOLEJKGSIX/action/author_attestation","sign_citation":"https://pith.science/pith/MVM2MGSBA6HBQZJIAOLEJKGSIX/action/citation_signature","submit_replication":"https://pith.science/pith/MVM2MGSBA6HBQZJIAOLEJKGSIX/action/replication_record"}},"created_at":"2026-05-18T03:20:57.108671+00:00","updated_at":"2026-05-18T03:20:57.108671+00:00"}