{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PLSM37VTX5HKN4OHK3DKHHM76I","short_pith_number":"pith:PLSM37VT","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"},"canonical_sha256":"7ae4cdfeb3bf4ea6f1c756c6a39d9ff22e5e4512ee3e3087b187dbf1db5459ea","source":{"kind":"arxiv","id":"1305.1331","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PLSM37VTX5HKN4OHK3DKHHM76I","target":"record","payload":{"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"},"canonical_sha256":"7ae4cdfeb3bf4ea6f1c756c6a39d9ff22e5e4512ee3e3087b187dbf1db5459ea","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"},"source_kind":"arxiv","source_id":"1305.1331","source_version":3,"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-05-18T03:02:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1s3EM3NgGuWkPOk/YgBZHyrItebKXpA2PYlVFSmQHdUuoc7NhJEsk6tkhcEAWggbHiXttP/9+iyRYHkGqrBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:29:31.692988Z"},"content_sha256":"ace36b92e5bb49667eaf4501e61e8b6ce5198c3cb9a8f2afc5b101515a6c3df1","schema_version":"1.0","event_id":"sha256:ace36b92e5bb49667eaf4501e61e8b6ce5198c3cb9a8f2afc5b101515a6c3df1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PLSM37VTX5HKN4OHK3DKHHM76I","target":"graph","payload":{"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"},"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-05-18T03:02:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sozZWkF4SYOkps3oSGUkRYEu+CC+6fBbDyMILYKE3YZiLecqx3PKubehUHGAhJZ/D5zHajp1YNidqLy/J3dADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:29:31.693587Z"},"content_sha256":"724caac3e0b6e1cb55e03b5d8ec3cb56ba055c46bb87c49915e52431d24d3de3","schema_version":"1.0","event_id":"sha256:724caac3e0b6e1cb55e03b5d8ec3cb56ba055c46bb87c49915e52431d24d3de3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I/bundle.json","state_url":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLSM37VTX5HKN4OHK3DKHHM76I/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-05-30T13:29:31Z","links":{"resolver":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I","bundle":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I/bundle.json","state":"https://pith.science/pith/PLSM37VTX5HKN4OHK3DKHHM76I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLSM37VTX5HKN4OHK3DKHHM76I/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OYMtCprB9JaPug3CfBjMgFNudeJbjQRse9Fvqq3Nan9KaXic0tGTz/gP7fumWzVy2wAKg6tYwGURO0VMeUWwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:29:31.696989Z","bundle_sha256":"f074a8099d525204895dffa3d3533feb92437d1fe9df11ef322d6ded8d524677"}}