{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:T6LIK6A6AHWNQ4KCNPQCHH7QKH","short_pith_number":"pith:T6LIK6A6","schema_version":"1.0","canonical_sha256":"9f9685781e01ecd871426be0239ff051deeb978ea8950a994d5bf18b216b0c8b","source":{"kind":"arxiv","id":"2412.17756","version":2},"attestation_state":"computed","paper":{"title":"Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl","submitted_at":"2024-12-23T18:08:25Z","abstract_excerpt":"The pathwidth of a graph $G$ is the smallest $w\\in \\mathbb{N}$ such that $G$ can be constructed from a sequence of graphs, each on at most $w+1$ vertices, by gluing them together in a linear fashion. We provide a full classification of the unavoidable induced subgraphs of graphs with large pathwidth."},"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":"2412.17756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T18:08:25Z","cross_cats_sorted":[],"title_canon_sha256":"99c3c8c442ac227d26bea32d6c20de3018993dd1c1e4cf3a90c30c82793357d7","abstract_canon_sha256":"3ae9afe03ed60a3a30e9a0518eeddab90771f723b84a9c69f8846888ea276823"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:30.896175Z","signature_b64":"liXf0gtnLeXQrHr/LQzU5TzcVcMfpS0NX2PJPEpf3vhK53aEnTP+wJlXwmaRO0rskyx0K126tZLTBoZFUTXoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f9685781e01ecd871426be0239ff051deeb978ea8950a994d5bf18b216b0c8b","last_reissued_at":"2026-07-05T09:54:30.895834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:30.895834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl","submitted_at":"2024-12-23T18:08:25Z","abstract_excerpt":"The pathwidth of a graph $G$ is the smallest $w\\in \\mathbb{N}$ such that $G$ can be constructed from a sequence of graphs, each on at most $w+1$ vertices, by gluing them together in a linear fashion. We provide a full classification of the unavoidable induced subgraphs of graphs with large pathwidth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17756","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.17756/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.17756","created_at":"2026-07-05T09:54:30.895893+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17756v2","created_at":"2026-07-05T09:54:30.895893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17756","created_at":"2026-07-05T09:54:30.895893+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6LIK6A6AHWN","created_at":"2026-07-05T09:54:30.895893+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6LIK6A6AHWNQ4KC","created_at":"2026-07-05T09:54:30.895893+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6LIK6A6","created_at":"2026-07-05T09:54:30.895893+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/T6LIK6A6AHWNQ4KCNPQCHH7QKH","json":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH.json","graph_json":"https://pith.science/api/pith-number/T6LIK6A6AHWNQ4KCNPQCHH7QKH/graph.json","events_json":"https://pith.science/api/pith-number/T6LIK6A6AHWNQ4KCNPQCHH7QKH/events.json","paper":"https://pith.science/paper/T6LIK6A6"},"agent_actions":{"view_html":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH","download_json":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH.json","view_paper":"https://pith.science/paper/T6LIK6A6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17756&json=true","fetch_graph":"https://pith.science/api/pith-number/T6LIK6A6AHWNQ4KCNPQCHH7QKH/graph.json","fetch_events":"https://pith.science/api/pith-number/T6LIK6A6AHWNQ4KCNPQCHH7QKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/action/storage_attestation","attest_author":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/action/author_attestation","sign_citation":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/action/citation_signature","submit_replication":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/action/replication_record"}},"created_at":"2026-07-05T09:54:30.895893+00:00","updated_at":"2026-07-05T09:54:30.895893+00:00"}