{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VCP7FMKNWS7KE2OZSRXGPACGC4","short_pith_number":"pith:VCP7FMKN","schema_version":"1.0","canonical_sha256":"a89ff2b14db4bea269d9946e678046172fad16f26295e7e019a9d10a0cd2bb2f","source":{"kind":"arxiv","id":"1408.3869","version":2},"attestation_state":"computed","paper":{"title":"Treewidth of graphs with balanced separations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Sergey Norin, Zdenek Dvorak","submitted_at":"2014-08-17T22:14:36Z","abstract_excerpt":"We prove that if every subgraph of a graph $G$ has a balanced separation of order at most $a$ then $G$ has treewidth at most $15a$. This establishes a linear dependence between the treewidth and the separation number."},"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":"1408.3869","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-17T22:14:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8de3645f8d3ec861238892e0d0a6cc685a4f73bf42cf0956b42c61b77bddb0fb","abstract_canon_sha256":"263267d5d0c35dcc8b67fda0993b548dc174740a8329ad2ee3e59c958404e76d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:51.187962Z","signature_b64":"4n0r/LhYKaIWUnI5YN6y2GdIC39IMZl0oUuwNjl2HFoUMvhs3Uolh4AtHLqYLNwsUnlxL3vH/CNHFztGjGqwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a89ff2b14db4bea269d9946e678046172fad16f26295e7e019a9d10a0cd2bb2f","last_reissued_at":"2026-05-17T23:57:51.187267Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:51.187267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Treewidth of graphs with balanced separations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Sergey Norin, Zdenek Dvorak","submitted_at":"2014-08-17T22:14:36Z","abstract_excerpt":"We prove that if every subgraph of a graph $G$ has a balanced separation of order at most $a$ then $G$ has treewidth at most $15a$. This establishes a linear dependence between the treewidth and the separation number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3869","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":"1408.3869","created_at":"2026-05-17T23:57:51.187369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3869v2","created_at":"2026-05-17T23:57:51.187369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3869","created_at":"2026-05-17T23:57:51.187369+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCP7FMKNWS7K","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCP7FMKNWS7KE2OZ","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCP7FMKN","created_at":"2026-05-18T12:28:52.271510+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/VCP7FMKNWS7KE2OZSRXGPACGC4","json":"https://pith.science/pith/VCP7FMKNWS7KE2OZSRXGPACGC4.json","graph_json":"https://pith.science/api/pith-number/VCP7FMKNWS7KE2OZSRXGPACGC4/graph.json","events_json":"https://pith.science/api/pith-number/VCP7FMKNWS7KE2OZSRXGPACGC4/events.json","paper":"https://pith.science/paper/VCP7FMKN"},"agent_actions":{"view_html":"https://pith.science/pith/VCP7FMKNWS7KE2OZSRXGPACGC4","download_json":"https://pith.science/pith/VCP7FMKNWS7KE2OZSRXGPACGC4.json","view_paper":"https://pith.science/paper/VCP7FMKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3869&json=true","fetch_graph":"https://pith.science/api/pith-number/VCP7FMKNWS7KE2OZSRXGPACGC4/graph.json","fetch_events":"https://pith.science/api/pith-number/VCP7FMKNWS7KE2OZSRXGPACGC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCP7FMKNWS7KE2OZSRXGPACGC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCP7FMKNWS7KE2OZSRXGPACGC4/action/storage_attestation","attest_author":"https://pith.science/pith/VCP7FMKNWS7KE2OZSRXGPACGC4/action/author_attestation","sign_citation":"https://pith.science/pith/VCP7FMKNWS7KE2OZSRXGPACGC4/action/citation_signature","submit_replication":"https://pith.science/pith/VCP7FMKNWS7KE2OZSRXGPACGC4/action/replication_record"}},"created_at":"2026-05-17T23:57:51.187369+00:00","updated_at":"2026-05-17T23:57:51.187369+00:00"}