{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PLSM37VTX5HKN4OHK3DKHHM76I","short_pith_number":"pith:PLSM37VT","schema_version":"1.0","canonical_sha256":"7ae4cdfeb3bf4ea6f1c756c6a39d9ff22e5e4512ee3e3087b187dbf1db5459ea","source":{"kind":"arxiv","id":"1305.1331","version":3},"attestation_state":"computed","paper":{"title":"Immersions in highly edge connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Marx, Paul Wollan","submitted_at":"2013-05-06T21:00:38Z","abstract_excerpt":"We consider the problem of how much edge connectivity is necessary to force a graph G to contain a fixed graph H as an immersion. We show that if the maximum degree in H is D, then all the examples of D-edge connected graphs which do not contain H as a weak immersion must have a tree-like decomposition called a tree-cut decomposition of bounded width. If we consider strong immersions, then it is easy to see that there are arbitrarily highly edge connected graphs which do not contain a fixed clique K_t as a strong immersion. We give a structure theorem which roughly characterizes those highly e"},"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":"1305.1331","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-06T21:00:38Z","cross_cats_sorted":[],"title_canon_sha256":"769c93e91d9b7c96435250af2b2b7f5747eab222b1f4b49a78ae25051b0168cb","abstract_canon_sha256":"62911b92a9dae417acf07e7e9e141f9cd4dab5e48de8044489bbbd8ca613f084"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:34.955286Z","signature_b64":"VXwZN53r4wSUQN/BUZr2gJ434fsNB2efr7EXn2ASDu3dL+77Sd3O/Mj8xTml/5gtW4yvuK755Oifp3UyL1XLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ae4cdfeb3bf4ea6f1c756c6a39d9ff22e5e4512ee3e3087b187dbf1db5459ea","last_reissued_at":"2026-05-18T03:02:34.954535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:34.954535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Immersions in highly edge connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Marx, Paul Wollan","submitted_at":"2013-05-06T21:00:38Z","abstract_excerpt":"We consider the problem of how much edge connectivity is necessary to force a graph G to contain a fixed graph H as an immersion. We show that if the maximum degree in H is D, then all the examples of D-edge connected graphs which do not contain H as a weak immersion must have a tree-like decomposition called a tree-cut decomposition of bounded width. If we consider strong immersions, then it is easy to see that there are arbitrarily highly edge connected graphs which do not contain a fixed clique K_t as a strong immersion. We give a structure theorem which roughly characterizes those highly e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1331","kind":"arxiv","version":3},"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":"1305.1331","created_at":"2026-05-18T03:02:34.954658+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1331v3","created_at":"2026-05-18T03:02:34.954658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1331","created_at":"2026-05-18T03:02:34.954658+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLSM37VTX5HK","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLSM37VTX5HKN4OH","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLSM37VT","created_at":"2026-05-18T12:27:54.935989+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/PLSM37VTX5HKN4OHK3DKHHM76I","json":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I.json","graph_json":"https://pith.science/api/pith-number/PLSM37VTX5HKN4OHK3DKHHM76I/graph.json","events_json":"https://pith.science/api/pith-number/PLSM37VTX5HKN4OHK3DKHHM76I/events.json","paper":"https://pith.science/paper/PLSM37VT"},"agent_actions":{"view_html":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I","download_json":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I.json","view_paper":"https://pith.science/paper/PLSM37VT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1331&json=true","fetch_graph":"https://pith.science/api/pith-number/PLSM37VTX5HKN4OHK3DKHHM76I/graph.json","fetch_events":"https://pith.science/api/pith-number/PLSM37VTX5HKN4OHK3DKHHM76I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I/action/storage_attestation","attest_author":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I/action/author_attestation","sign_citation":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I/action/citation_signature","submit_replication":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I/action/replication_record"}},"created_at":"2026-05-18T03:02:34.954658+00:00","updated_at":"2026-05-18T03:02:34.954658+00:00"}