{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:T6LIK6A6AHWNQ4KCNPQCHH7QKH","short_pith_number":"pith:T6LIK6A6","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"},"canonical_sha256":"9f9685781e01ecd871426be0239ff051deeb978ea8950a994d5bf18b216b0c8b","source":{"kind":"arxiv","id":"2412.17756","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17756","created_at":"2026-07-05T09:54:30Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17756v2","created_at":"2026-07-05T09:54:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17756","created_at":"2026-07-05T09:54:30Z"},{"alias_kind":"pith_short_12","alias_value":"T6LIK6A6AHWN","created_at":"2026-07-05T09:54:30Z"},{"alias_kind":"pith_short_16","alias_value":"T6LIK6A6AHWNQ4KC","created_at":"2026-07-05T09:54:30Z"},{"alias_kind":"pith_short_8","alias_value":"T6LIK6A6","created_at":"2026-07-05T09:54:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:T6LIK6A6AHWNQ4KCNPQCHH7QKH","target":"record","payload":{"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"},"canonical_sha256":"9f9685781e01ecd871426be0239ff051deeb978ea8950a994d5bf18b216b0c8b","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"},"source_kind":"arxiv","source_id":"2412.17756","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:54:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTu1ZsWEJ3m07/+KQxgkoLMZfxSiQ5xJklUiYKj/wwrb/hgZxOhDrpPVaxcVk8TGcMQwQ7NymgF56KKEd8Z7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T05:59:38.874823Z"},"content_sha256":"0343bb70b4173a0ed907410d22dcb5bd5340ee518444d0ea933ac9f3c9b54f63","schema_version":"1.0","event_id":"sha256:0343bb70b4173a0ed907410d22dcb5bd5340ee518444d0ea933ac9f3c9b54f63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:T6LIK6A6AHWNQ4KCNPQCHH7QKH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:54:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qeETFznY8CI9/GKMr67+NcTZHlTFZ1gJuvKgk38S64Jpj7Y4uV53RuWkJBDdWpoIh8Q7B3E1qDbsx/e4X0LkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T05:59:38.875259Z"},"content_sha256":"d149e6589f77a3c85dd42ab399a196da3a1b231e87beb49ad6d16705ac8fd5c2","schema_version":"1.0","event_id":"sha256:d149e6589f77a3c85dd42ab399a196da3a1b231e87beb49ad6d16705ac8fd5c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/bundle.json","state_url":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T05:59:38Z","links":{"resolver":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH","bundle":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/bundle.json","state":"https://pith.science/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6LIK6A6AHWNQ4KCNPQCHH7QKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:T6LIK6A6AHWNQ4KCNPQCHH7QKH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3ae9afe03ed60a3a30e9a0518eeddab90771f723b84a9c69f8846888ea276823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T18:08:25Z","title_canon_sha256":"99c3c8c442ac227d26bea32d6c20de3018993dd1c1e4cf3a90c30c82793357d7"},"schema_version":"1.0","source":{"id":"2412.17756","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17756","created_at":"2026-07-05T09:54:30Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17756v2","created_at":"2026-07-05T09:54:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17756","created_at":"2026-07-05T09:54:30Z"},{"alias_kind":"pith_short_12","alias_value":"T6LIK6A6AHWN","created_at":"2026-07-05T09:54:30Z"},{"alias_kind":"pith_short_16","alias_value":"T6LIK6A6AHWNQ4KC","created_at":"2026-07-05T09:54:30Z"},{"alias_kind":"pith_short_8","alias_value":"T6LIK6A6","created_at":"2026-07-05T09:54:30Z"}],"graph_snapshots":[{"event_id":"sha256:d149e6589f77a3c85dd42ab399a196da3a1b231e87beb49ad6d16705ac8fd5c2","target":"graph","created_at":"2026-07-05T09:54:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.17756/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T18:08:25Z","title":"Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17756","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0343bb70b4173a0ed907410d22dcb5bd5340ee518444d0ea933ac9f3c9b54f63","target":"record","created_at":"2026-07-05T09:54:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3ae9afe03ed60a3a30e9a0518eeddab90771f723b84a9c69f8846888ea276823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-23T18:08:25Z","title_canon_sha256":"99c3c8c442ac227d26bea32d6c20de3018993dd1c1e4cf3a90c30c82793357d7"},"schema_version":"1.0","source":{"id":"2412.17756","kind":"arxiv","version":2}},"canonical_sha256":"9f9685781e01ecd871426be0239ff051deeb978ea8950a994d5bf18b216b0c8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f9685781e01ecd871426be0239ff051deeb978ea8950a994d5bf18b216b0c8b","first_computed_at":"2026-07-05T09:54:30.895834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:54:30.895834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"liXf0gtnLeXQrHr/LQzU5TzcVcMfpS0NX2PJPEpf3vhK53aEnTP+wJlXwmaRO0rskyx0K126tZLTBoZFUTXoAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:54:30.896175Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.17756","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0343bb70b4173a0ed907410d22dcb5bd5340ee518444d0ea933ac9f3c9b54f63","sha256:d149e6589f77a3c85dd42ab399a196da3a1b231e87beb49ad6d16705ac8fd5c2"],"state_sha256":"d19314844d8f730bf73a1dfbae12bdad874824f2b6460de1eef1e2a94b12972f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s6ReNSZnH38vXMLwzg6m0R/K/T4jcyGTdd1/5LzVuO9is1hhJLu9ohZNgBbKd9W1qpZEzYimTy+JufAGj+AMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T05:59:38.879262Z","bundle_sha256":"8010dbb0942dcfaff884f67c0a620e5fa63c3b52216c1b26fcd17e422994cde1"}}