{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MRTT7WA5NLJ7SLY7476EHYYCMF","short_pith_number":"pith:MRTT7WA5","schema_version":"1.0","canonical_sha256":"64673fd81d6ad3f92f1fe7fc43e3026150f11a4c1adf1aca9ada719d49331961","source":{"kind":"arxiv","id":"2410.20333","version":1},"attestation_state":"computed","paper":{"title":"Product Structure and Tree-Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, David R. Wood, Sergey Norin","submitted_at":"2024-10-27T04:22:44Z","abstract_excerpt":"This paper explores the structure of graphs defined by an excluded minor or an excluded odd minor through the lens of graph products and tree-decompositions. We prove that every graph excluding a fixed odd minor is contained in the strong product of two graphs each with bounded treewidth. For graphs excluding a fixed minor, we strengthen the result by showing that every such graph is contained in the strong product of two digraphs with bounded indegree and with bounded treewidth. This result has the advantage that the product now has bounded degeneracy.\n  In the setting of 3-term products, we "},"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":"2410.20333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-27T04:22:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d97cb5cb769e79dd39a003a3af49b32d03f59108e449c9001d2c87ca3010910b","abstract_canon_sha256":"5b6529672e036ecb8951514be6cb401020deeb36b1d6e07167e7899604137181"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:43.321629Z","signature_b64":"HnqJHR5G3LlWNadAjBsgQakzUp4EcmN+gxU1B2KtRxXBYl64dHnqx5wpA5T90+yBWgw0SSJYmLewT5CFhNduCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64673fd81d6ad3f92f1fe7fc43e3026150f11a4c1adf1aca9ada719d49331961","last_reissued_at":"2026-07-05T09:26:43.321017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:43.321017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Product Structure and Tree-Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, David R. Wood, Sergey Norin","submitted_at":"2024-10-27T04:22:44Z","abstract_excerpt":"This paper explores the structure of graphs defined by an excluded minor or an excluded odd minor through the lens of graph products and tree-decompositions. We prove that every graph excluding a fixed odd minor is contained in the strong product of two graphs each with bounded treewidth. For graphs excluding a fixed minor, we strengthen the result by showing that every such graph is contained in the strong product of two digraphs with bounded indegree and with bounded treewidth. This result has the advantage that the product now has bounded degeneracy.\n  In the setting of 3-term products, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20333","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.20333/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":"2410.20333","created_at":"2026-07-05T09:26:43.321097+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.20333v1","created_at":"2026-07-05T09:26:43.321097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20333","created_at":"2026-07-05T09:26:43.321097+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRTT7WA5NLJ7","created_at":"2026-07-05T09:26:43.321097+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRTT7WA5NLJ7SLY7","created_at":"2026-07-05T09:26:43.321097+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRTT7WA5","created_at":"2026-07-05T09:26:43.321097+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.01140","citing_title":"Tree decompositions with small width, spread, order and degree","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05690","citing_title":"Tree-partitions and small-spread tree-decompositions","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MRTT7WA5NLJ7SLY7476EHYYCMF","json":"https://pith.science/pith/MRTT7WA5NLJ7SLY7476EHYYCMF.json","graph_json":"https://pith.science/api/pith-number/MRTT7WA5NLJ7SLY7476EHYYCMF/graph.json","events_json":"https://pith.science/api/pith-number/MRTT7WA5NLJ7SLY7476EHYYCMF/events.json","paper":"https://pith.science/paper/MRTT7WA5"},"agent_actions":{"view_html":"https://pith.science/pith/MRTT7WA5NLJ7SLY7476EHYYCMF","download_json":"https://pith.science/pith/MRTT7WA5NLJ7SLY7476EHYYCMF.json","view_paper":"https://pith.science/paper/MRTT7WA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.20333&json=true","fetch_graph":"https://pith.science/api/pith-number/MRTT7WA5NLJ7SLY7476EHYYCMF/graph.json","fetch_events":"https://pith.science/api/pith-number/MRTT7WA5NLJ7SLY7476EHYYCMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRTT7WA5NLJ7SLY7476EHYYCMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRTT7WA5NLJ7SLY7476EHYYCMF/action/storage_attestation","attest_author":"https://pith.science/pith/MRTT7WA5NLJ7SLY7476EHYYCMF/action/author_attestation","sign_citation":"https://pith.science/pith/MRTT7WA5NLJ7SLY7476EHYYCMF/action/citation_signature","submit_replication":"https://pith.science/pith/MRTT7WA5NLJ7SLY7476EHYYCMF/action/replication_record"}},"created_at":"2026-07-05T09:26:43.321097+00:00","updated_at":"2026-07-05T09:26:43.321097+00:00"}