{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TM2FSNRZQTP5EXII5F6GUBYK26","short_pith_number":"pith:TM2FSNRZ","schema_version":"1.0","canonical_sha256":"9b3459363984dfd25d08e97c6a070ad7866361ad37b896bafb3cc609b929a84e","source":{"kind":"arxiv","id":"1309.2266","version":1},"attestation_state":"computed","paper":{"title":"A simple proof of the tree-width duality theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Mazoit (LaBRI)","submitted_at":"2013-09-09T19:17:56Z","abstract_excerpt":"We give a simple proof of the \"tree-width duality theorem\" of Seymour and Thomas that the tree-width of a finite graph is exactly one less than the largest order of its brambles."},"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":"1309.2266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-09T19:17:56Z","cross_cats_sorted":[],"title_canon_sha256":"c6280194a001f0a29a32e2521b47f75b49317fc8ecce37a4d27a51df0a2ba78a","abstract_canon_sha256":"43dd0a1ef568343e5412252cddfac9f1f8d99bc2d1ace6fd7f3e894001b8fc4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:46.792463Z","signature_b64":"KuR6qCFrskSZSZ+wCa+0UfVv+27ouPfdBcWAE8Cple6QXjlZNrsk84qpJZ12yNpiNu40JOomhSwWyBQZYF3UAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b3459363984dfd25d08e97c6a070ad7866361ad37b896bafb3cc609b929a84e","last_reissued_at":"2026-05-18T03:13:46.791693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:46.791693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple proof of the tree-width duality theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Mazoit (LaBRI)","submitted_at":"2013-09-09T19:17:56Z","abstract_excerpt":"We give a simple proof of the \"tree-width duality theorem\" of Seymour and Thomas that the tree-width of a finite graph is exactly one less than the largest order of its brambles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2266","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":"1309.2266","created_at":"2026-05-18T03:13:46.791810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2266v1","created_at":"2026-05-18T03:13:46.791810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2266","created_at":"2026-05-18T03:13:46.791810+00:00"},{"alias_kind":"pith_short_12","alias_value":"TM2FSNRZQTP5","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TM2FSNRZQTP5EXII","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TM2FSNRZ","created_at":"2026-05-18T12:28:02.375192+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/TM2FSNRZQTP5EXII5F6GUBYK26","json":"https://pith.science/pith/TM2FSNRZQTP5EXII5F6GUBYK26.json","graph_json":"https://pith.science/api/pith-number/TM2FSNRZQTP5EXII5F6GUBYK26/graph.json","events_json":"https://pith.science/api/pith-number/TM2FSNRZQTP5EXII5F6GUBYK26/events.json","paper":"https://pith.science/paper/TM2FSNRZ"},"agent_actions":{"view_html":"https://pith.science/pith/TM2FSNRZQTP5EXII5F6GUBYK26","download_json":"https://pith.science/pith/TM2FSNRZQTP5EXII5F6GUBYK26.json","view_paper":"https://pith.science/paper/TM2FSNRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2266&json=true","fetch_graph":"https://pith.science/api/pith-number/TM2FSNRZQTP5EXII5F6GUBYK26/graph.json","fetch_events":"https://pith.science/api/pith-number/TM2FSNRZQTP5EXII5F6GUBYK26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TM2FSNRZQTP5EXII5F6GUBYK26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TM2FSNRZQTP5EXII5F6GUBYK26/action/storage_attestation","attest_author":"https://pith.science/pith/TM2FSNRZQTP5EXII5F6GUBYK26/action/author_attestation","sign_citation":"https://pith.science/pith/TM2FSNRZQTP5EXII5F6GUBYK26/action/citation_signature","submit_replication":"https://pith.science/pith/TM2FSNRZQTP5EXII5F6GUBYK26/action/replication_record"}},"created_at":"2026-05-18T03:13:46.791810+00:00","updated_at":"2026-05-18T03:13:46.791810+00:00"}