{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PLSM37VTX5HKN4OHK3DKHHM76I","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":"62911b92a9dae417acf07e7e9e141f9cd4dab5e48de8044489bbbd8ca613f084","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-06T21:00:38Z","title_canon_sha256":"769c93e91d9b7c96435250af2b2b7f5747eab222b1f4b49a78ae25051b0168cb"},"schema_version":"1.0","source":{"id":"1305.1331","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1331","created_at":"2026-05-18T03:02:34Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1331v3","created_at":"2026-05-18T03:02:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1331","created_at":"2026-05-18T03:02:34Z"},{"alias_kind":"pith_short_12","alias_value":"PLSM37VTX5HK","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PLSM37VTX5HKN4OH","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PLSM37VT","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:724caac3e0b6e1cb55e03b5d8ec3cb56ba055c46bb87c49915e52431d24d3de3","target":"graph","created_at":"2026-05-18T03:02:34Z","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"},"paper":{"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","authors_text":"Daniel Marx, Paul Wollan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-06T21:00:38Z","title":"Immersions in highly edge connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1331","kind":"arxiv","version":3},"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:ace36b92e5bb49667eaf4501e61e8b6ce5198c3cb9a8f2afc5b101515a6c3df1","target":"record","created_at":"2026-05-18T03:02:34Z","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":"62911b92a9dae417acf07e7e9e141f9cd4dab5e48de8044489bbbd8ca613f084","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-06T21:00:38Z","title_canon_sha256":"769c93e91d9b7c96435250af2b2b7f5747eab222b1f4b49a78ae25051b0168cb"},"schema_version":"1.0","source":{"id":"1305.1331","kind":"arxiv","version":3}},"canonical_sha256":"7ae4cdfeb3bf4ea6f1c756c6a39d9ff22e5e4512ee3e3087b187dbf1db5459ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ae4cdfeb3bf4ea6f1c756c6a39d9ff22e5e4512ee3e3087b187dbf1db5459ea","first_computed_at":"2026-05-18T03:02:34.954535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:34.954535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VXwZN53r4wSUQN/BUZr2gJ434fsNB2efr7EXn2ASDu3dL+77Sd3O/Mj8xTml/5gtW4yvuK755Oifp3UyL1XLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:34.955286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1331","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ace36b92e5bb49667eaf4501e61e8b6ce5198c3cb9a8f2afc5b101515a6c3df1","sha256:724caac3e0b6e1cb55e03b5d8ec3cb56ba055c46bb87c49915e52431d24d3de3"],"state_sha256":"e787f5bd22e68fc3e77dfcb235061c8995163e8a4179fb98b571016a17118d01"}