{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EYCWWC6FY3A5ZKTQDDWAPVW2RP","short_pith_number":"pith:EYCWWC6F","schema_version":"1.0","canonical_sha256":"26056b0bc5c6c1dcaa7018ec07d6da8bd7981a7a8fda03588942fcb8df7d1a54","source":{"kind":"arxiv","id":"1308.0827","version":1},"attestation_state":"computed","paper":{"title":"Immersion in four-edge-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Paul Seymour, Tereza Klimo\\v{s}ov\\'a, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2013-08-04T16:49:53Z","abstract_excerpt":"Fix g>1. Every graph of large enough tree-width contains a g x g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g x g grid as an immersion (and hence contains any fixed graph with maximum degree at most four as an immersion). This result has a number of applications."},"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":"1308.0827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-04T16:49:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"68814728dd8cee739514d3928342d882ed1256277ae129b3d6b2da0480942949","abstract_canon_sha256":"0df9074a9b299524c800ff2213ee510c87813867c4b177b63baed445cef0ee4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:48.042496Z","signature_b64":"vLnTrm96q1dE84Ae3Wg4A5+95ThBS81gYRvNYyf50i9g3B5xwqdHN2tp0h7plNpzucd/5OokTBACQW8seI5yAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26056b0bc5c6c1dcaa7018ec07d6da8bd7981a7a8fda03588942fcb8df7d1a54","last_reissued_at":"2026-05-18T03:16:48.041930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:48.041930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Immersion in four-edge-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Paul Seymour, Tereza Klimo\\v{s}ov\\'a, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2013-08-04T16:49:53Z","abstract_excerpt":"Fix g>1. Every graph of large enough tree-width contains a g x g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g x g grid as an immersion (and hence contains any fixed graph with maximum degree at most four as an immersion). This result has a number of applications."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0827","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":"1308.0827","created_at":"2026-05-18T03:16:48.042017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0827v1","created_at":"2026-05-18T03:16:48.042017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0827","created_at":"2026-05-18T03:16:48.042017+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYCWWC6FY3A5","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYCWWC6FY3A5ZKTQ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYCWWC6F","created_at":"2026-05-18T12:27:43.054852+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/EYCWWC6FY3A5ZKTQDDWAPVW2RP","json":"https://pith.science/pith/EYCWWC6FY3A5ZKTQDDWAPVW2RP.json","graph_json":"https://pith.science/api/pith-number/EYCWWC6FY3A5ZKTQDDWAPVW2RP/graph.json","events_json":"https://pith.science/api/pith-number/EYCWWC6FY3A5ZKTQDDWAPVW2RP/events.json","paper":"https://pith.science/paper/EYCWWC6F"},"agent_actions":{"view_html":"https://pith.science/pith/EYCWWC6FY3A5ZKTQDDWAPVW2RP","download_json":"https://pith.science/pith/EYCWWC6FY3A5ZKTQDDWAPVW2RP.json","view_paper":"https://pith.science/paper/EYCWWC6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0827&json=true","fetch_graph":"https://pith.science/api/pith-number/EYCWWC6FY3A5ZKTQDDWAPVW2RP/graph.json","fetch_events":"https://pith.science/api/pith-number/EYCWWC6FY3A5ZKTQDDWAPVW2RP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYCWWC6FY3A5ZKTQDDWAPVW2RP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYCWWC6FY3A5ZKTQDDWAPVW2RP/action/storage_attestation","attest_author":"https://pith.science/pith/EYCWWC6FY3A5ZKTQDDWAPVW2RP/action/author_attestation","sign_citation":"https://pith.science/pith/EYCWWC6FY3A5ZKTQDDWAPVW2RP/action/citation_signature","submit_replication":"https://pith.science/pith/EYCWWC6FY3A5ZKTQDDWAPVW2RP/action/replication_record"}},"created_at":"2026-05-18T03:16:48.042017+00:00","updated_at":"2026-05-18T03:16:48.042017+00:00"}