{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DNLPF7D3PHS3BC47PRTWKYEQZG","short_pith_number":"pith:DNLPF7D3","schema_version":"1.0","canonical_sha256":"1b56f2fc7b79e5b08b9f7c67656090c98bb412b7f8c6de641965778cf29156d6","source":{"kind":"arxiv","id":"1006.3167","version":2},"attestation_state":"computed","paper":{"title":"Tree-width of hypergraphs and surface duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Fr\\'ed\\'eric Mazoit (LaBRI)","submitted_at":"2010-06-16T09:00:16Z","abstract_excerpt":"In Graph Minors III, Robertson and Seymour write: \"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal - indeed, we have convinced ourselves that they differ by at most one\". They never gave a proof of this. In this paper, we prove a generalisation of this statement to embedding of hypergraphs on general surfaces, and we prove that our 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":"1006.3167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-06-16T09:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"469ccfa6672db8aa14563f3bf429505c226aafe60d6262ce0615d898a4820a7c","abstract_canon_sha256":"db3a799432bd28e1b3204331caf4e921f3d6d6781a116a4c507fa4fd833dfa7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:17.900460Z","signature_b64":"4zvZCPZq3qIjLSdEz02ih9b7CMU0TRNv32Mf6aPyCCSyEqdCNUUvU+hehtCXMg2NqOx6PZi8xBOHXIRQfiXVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b56f2fc7b79e5b08b9f7c67656090c98bb412b7f8c6de641965778cf29156d6","last_reissued_at":"2026-05-18T04:07:17.899694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:17.899694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-width of hypergraphs and surface duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Fr\\'ed\\'eric Mazoit (LaBRI)","submitted_at":"2010-06-16T09:00:16Z","abstract_excerpt":"In Graph Minors III, Robertson and Seymour write: \"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal - indeed, we have convinced ourselves that they differ by at most one\". They never gave a proof of this. In this paper, we prove a generalisation of this statement to embedding of hypergraphs on general surfaces, and we prove that our bound is tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3167","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":"1006.3167","created_at":"2026-05-18T04:07:17.899802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.3167v2","created_at":"2026-05-18T04:07:17.899802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3167","created_at":"2026-05-18T04:07:17.899802+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNLPF7D3PHS3","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNLPF7D3PHS3BC47","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNLPF7D3","created_at":"2026-05-18T12:26:06.534383+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/DNLPF7D3PHS3BC47PRTWKYEQZG","json":"https://pith.science/pith/DNLPF7D3PHS3BC47PRTWKYEQZG.json","graph_json":"https://pith.science/api/pith-number/DNLPF7D3PHS3BC47PRTWKYEQZG/graph.json","events_json":"https://pith.science/api/pith-number/DNLPF7D3PHS3BC47PRTWKYEQZG/events.json","paper":"https://pith.science/paper/DNLPF7D3"},"agent_actions":{"view_html":"https://pith.science/pith/DNLPF7D3PHS3BC47PRTWKYEQZG","download_json":"https://pith.science/pith/DNLPF7D3PHS3BC47PRTWKYEQZG.json","view_paper":"https://pith.science/paper/DNLPF7D3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.3167&json=true","fetch_graph":"https://pith.science/api/pith-number/DNLPF7D3PHS3BC47PRTWKYEQZG/graph.json","fetch_events":"https://pith.science/api/pith-number/DNLPF7D3PHS3BC47PRTWKYEQZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNLPF7D3PHS3BC47PRTWKYEQZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNLPF7D3PHS3BC47PRTWKYEQZG/action/storage_attestation","attest_author":"https://pith.science/pith/DNLPF7D3PHS3BC47PRTWKYEQZG/action/author_attestation","sign_citation":"https://pith.science/pith/DNLPF7D3PHS3BC47PRTWKYEQZG/action/citation_signature","submit_replication":"https://pith.science/pith/DNLPF7D3PHS3BC47PRTWKYEQZG/action/replication_record"}},"created_at":"2026-05-18T04:07:17.899802+00:00","updated_at":"2026-05-18T04:07:17.899802+00:00"}