{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:B2VHXCG5EFRSQL6TM4BFG2X2IL","short_pith_number":"pith:B2VHXCG5","canonical_record":{"source":{"id":"2503.21574","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-27T14:53:06Z","cross_cats_sorted":[],"title_canon_sha256":"2abc4e2103557f65ac9b0097bc797af8b4ad48d0024e9393dcf1dd09fece9fd1","abstract_canon_sha256":"634980765598aefc8981ff02e37d93f4c20254d3da82d7e2227d84819b72a68c"},"schema_version":"1.0"},"canonical_sha256":"0eaa7b88dd2163282fd36702536afa42e3245ebd43ad4d8bb6dacce7b43bb980","source":{"kind":"arxiv","id":"2503.21574","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.21574","created_at":"2026-06-09T02:08:29Z"},{"alias_kind":"arxiv_version","alias_value":"2503.21574v4","created_at":"2026-06-09T02:08:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.21574","created_at":"2026-06-09T02:08:29Z"},{"alias_kind":"pith_short_12","alias_value":"B2VHXCG5EFRS","created_at":"2026-06-09T02:08:29Z"},{"alias_kind":"pith_short_16","alias_value":"B2VHXCG5EFRSQL6T","created_at":"2026-06-09T02:08:29Z"},{"alias_kind":"pith_short_8","alias_value":"B2VHXCG5","created_at":"2026-06-09T02:08:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:B2VHXCG5EFRSQL6TM4BFG2X2IL","target":"record","payload":{"canonical_record":{"source":{"id":"2503.21574","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-27T14:53:06Z","cross_cats_sorted":[],"title_canon_sha256":"2abc4e2103557f65ac9b0097bc797af8b4ad48d0024e9393dcf1dd09fece9fd1","abstract_canon_sha256":"634980765598aefc8981ff02e37d93f4c20254d3da82d7e2227d84819b72a68c"},"schema_version":"1.0"},"canonical_sha256":"0eaa7b88dd2163282fd36702536afa42e3245ebd43ad4d8bb6dacce7b43bb980","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:29.515701Z","signature_b64":"D8P30kYVgva/mFE4SMB5US4lSE74UxAW+QxETrZIJ9PuGsh+GGa8Me4n8sP04LFGvlzgbJYSin7SsRoraZ4eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eaa7b88dd2163282fd36702536afa42e3245ebd43ad4d8bb6dacce7b43bb980","last_reissued_at":"2026-06-09T02:08:29.514625Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:29.514625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.21574","source_version":4,"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-06-09T02:08:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NvOcns+Q8q22iMYmfrBEAFtPHVJsGnLMvLce8B1GZL1S4yE9V0qd9ZajYJnqx3VZwp4RxjIhLMbsGdgTfqkODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:22:01.602052Z"},"content_sha256":"0eaad88a1b2c4a528b3c3473578dfbc094963803f4b111d2e570455e6ef3f887","schema_version":"1.0","event_id":"sha256:0eaad88a1b2c4a528b3c3473578dfbc094963803f4b111d2e570455e6ef3f887"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:B2VHXCG5EFRSQL6TM4BFG2X2IL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unavoidable substructures in large and infinite $2$-edge-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Every large or infinite 2-edge-connected graph contains one of a specific list of induced subgraphs that includes chains of pinched super-clean ladders.","cross_cats":[],"primary_cat":"math.CO","authors_text":"M. N. Ellingham, Sarah Allred","submitted_at":"2025-03-27T14:53:06Z","abstract_excerpt":"In 1930, Ramsey proved that every large graph contains either a large clique or a large edgeless graph as an induced subgraph. It is well known that every large connected graph contains a long path, a large clique, or a large star as an induced subgraph. Recently Allred, Ding, and Oporowski presented the unavoidable large induced subgraphs for large and infinite $2$-connected graphs. The $2$-edge-connected (sometimes called bridgeless) graphs form an important class between connected graphs and $2$-connected graphs. In this paper we describe the unavoidable large induced subgraphs for large an"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove the existence of ubiquitous structures in 2-edge-connected graphs known as chains of pinched super-clean ladders, and incorporate these into a presentation of the unavoidable large induced subgraphs for large and infinite 2-edge-connected graphs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The prior unavoidable-set result for 2-connected graphs (Allred, Ding, Oporowski) can be adapted to the strictly weaker 2-edge-connected setting by inserting the new ladder-chain structures without requiring additional connectivity assumptions or case distinctions that would invalidate the list.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The unavoidable large induced subgraphs of 2-edge-connected graphs are characterized via chains of pinched super-clean ladders, extending prior results for connected and 2-connected graphs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Every large or infinite 2-edge-connected graph contains one of a specific list of induced subgraphs that includes chains of pinched super-clean ladders.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"92a434dd29d7501ee5adc2d7df5a6b190924434f7447661b0763b17bd0578941"},"source":{"id":"2503.21574","kind":"arxiv","version":4},"verdict":{"id":"3806d49e-e877-43da-976d-ef1995129bf3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-22T22:29:07.601742Z","strongest_claim":"We prove the existence of ubiquitous structures in 2-edge-connected graphs known as chains of pinched super-clean ladders, and incorporate these into a presentation of the unavoidable large induced subgraphs for large and infinite 2-edge-connected graphs.","one_line_summary":"The unavoidable large induced subgraphs of 2-edge-connected graphs are characterized via chains of pinched super-clean ladders, extending prior results for connected and 2-connected graphs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The prior unavoidable-set result for 2-connected graphs (Allred, Ding, Oporowski) can be adapted to the strictly weaker 2-edge-connected setting by inserting the new ladder-chain structures without requiring additional connectivity assumptions or case distinctions that would invalidate the list.","pith_extraction_headline":"Every large or infinite 2-edge-connected graph contains one of a specific list of induced subgraphs that includes chains of pinched super-clean ladders."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.21574/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"},"verdict_id":"3806d49e-e877-43da-976d-ef1995129bf3"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T02:08:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TvsR8yh8dqo7fO4SL4yMc4cw1duBop//TSwIyK+v3U8TIrNm6cJznJPvUTelGmtGeEGpclClP/sL6cXDZdxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:22:01.602521Z"},"content_sha256":"de7fc50ee39c6020839b9edb3c718eaeda622a2bdb76e3bab4fe64791cf77826","schema_version":"1.0","event_id":"sha256:de7fc50ee39c6020839b9edb3c718eaeda622a2bdb76e3bab4fe64791cf77826"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2VHXCG5EFRSQL6TM4BFG2X2IL/bundle.json","state_url":"https://pith.science/pith/B2VHXCG5EFRSQL6TM4BFG2X2IL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2VHXCG5EFRSQL6TM4BFG2X2IL/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-06-09T12:22:01Z","links":{"resolver":"https://pith.science/pith/B2VHXCG5EFRSQL6TM4BFG2X2IL","bundle":"https://pith.science/pith/B2VHXCG5EFRSQL6TM4BFG2X2IL/bundle.json","state":"https://pith.science/pith/B2VHXCG5EFRSQL6TM4BFG2X2IL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2VHXCG5EFRSQL6TM4BFG2X2IL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:B2VHXCG5EFRSQL6TM4BFG2X2IL","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":"634980765598aefc8981ff02e37d93f4c20254d3da82d7e2227d84819b72a68c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-27T14:53:06Z","title_canon_sha256":"2abc4e2103557f65ac9b0097bc797af8b4ad48d0024e9393dcf1dd09fece9fd1"},"schema_version":"1.0","source":{"id":"2503.21574","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.21574","created_at":"2026-06-09T02:08:29Z"},{"alias_kind":"arxiv_version","alias_value":"2503.21574v4","created_at":"2026-06-09T02:08:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.21574","created_at":"2026-06-09T02:08:29Z"},{"alias_kind":"pith_short_12","alias_value":"B2VHXCG5EFRS","created_at":"2026-06-09T02:08:29Z"},{"alias_kind":"pith_short_16","alias_value":"B2VHXCG5EFRSQL6T","created_at":"2026-06-09T02:08:29Z"},{"alias_kind":"pith_short_8","alias_value":"B2VHXCG5","created_at":"2026-06-09T02:08:29Z"}],"graph_snapshots":[{"event_id":"sha256:de7fc50ee39c6020839b9edb3c718eaeda622a2bdb76e3bab4fe64791cf77826","target":"graph","created_at":"2026-06-09T02:08:29Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove the existence of ubiquitous structures in 2-edge-connected graphs known as chains of pinched super-clean ladders, and incorporate these into a presentation of the unavoidable large induced subgraphs for large and infinite 2-edge-connected graphs."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The prior unavoidable-set result for 2-connected graphs (Allred, Ding, Oporowski) can be adapted to the strictly weaker 2-edge-connected setting by inserting the new ladder-chain structures without requiring additional connectivity assumptions or case distinctions that would invalidate the list."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The unavoidable large induced subgraphs of 2-edge-connected graphs are characterized via chains of pinched super-clean ladders, extending prior results for connected and 2-connected graphs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Every large or infinite 2-edge-connected graph contains one of a specific list of induced subgraphs that includes chains of pinched super-clean ladders."}],"snapshot_sha256":"92a434dd29d7501ee5adc2d7df5a6b190924434f7447661b0763b17bd0578941"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.21574/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1930, Ramsey proved that every large graph contains either a large clique or a large edgeless graph as an induced subgraph. It is well known that every large connected graph contains a long path, a large clique, or a large star as an induced subgraph. Recently Allred, Ding, and Oporowski presented the unavoidable large induced subgraphs for large and infinite $2$-connected graphs. The $2$-edge-connected (sometimes called bridgeless) graphs form an important class between connected graphs and $2$-connected graphs. In this paper we describe the unavoidable large induced subgraphs for large an","authors_text":"M. N. Ellingham, Sarah Allred","cross_cats":[],"headline":"Every large or infinite 2-edge-connected graph contains one of a specific list of induced subgraphs that includes chains of pinched super-clean ladders.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-27T14:53:06Z","title":"Unavoidable substructures in large and infinite $2$-edge-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.21574","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-22T22:29:07.601742Z","id":"3806d49e-e877-43da-976d-ef1995129bf3","model_set":{"reader":"grok-4.3"},"one_line_summary":"The unavoidable large induced subgraphs of 2-edge-connected graphs are characterized via chains of pinched super-clean ladders, extending prior results for connected and 2-connected graphs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Every large or infinite 2-edge-connected graph contains one of a specific list of induced subgraphs that includes chains of pinched super-clean ladders.","strongest_claim":"We prove the existence of ubiquitous structures in 2-edge-connected graphs known as chains of pinched super-clean ladders, and incorporate these into a presentation of the unavoidable large induced subgraphs for large and infinite 2-edge-connected graphs.","weakest_assumption":"The prior unavoidable-set result for 2-connected graphs (Allred, Ding, Oporowski) can be adapted to the strictly weaker 2-edge-connected setting by inserting the new ladder-chain structures without requiring additional connectivity assumptions or case distinctions that would invalidate the list."}},"verdict_id":"3806d49e-e877-43da-976d-ef1995129bf3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0eaad88a1b2c4a528b3c3473578dfbc094963803f4b111d2e570455e6ef3f887","target":"record","created_at":"2026-06-09T02:08:29Z","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":"634980765598aefc8981ff02e37d93f4c20254d3da82d7e2227d84819b72a68c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-27T14:53:06Z","title_canon_sha256":"2abc4e2103557f65ac9b0097bc797af8b4ad48d0024e9393dcf1dd09fece9fd1"},"schema_version":"1.0","source":{"id":"2503.21574","kind":"arxiv","version":4}},"canonical_sha256":"0eaa7b88dd2163282fd36702536afa42e3245ebd43ad4d8bb6dacce7b43bb980","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0eaa7b88dd2163282fd36702536afa42e3245ebd43ad4d8bb6dacce7b43bb980","first_computed_at":"2026-06-09T02:08:29.514625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:08:29.514625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D8P30kYVgva/mFE4SMB5US4lSE74UxAW+QxETrZIJ9PuGsh+GGa8Me4n8sP04LFGvlzgbJYSin7SsRoraZ4eCw==","signature_status":"signed_v1","signed_at":"2026-06-09T02:08:29.515701Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.21574","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eaad88a1b2c4a528b3c3473578dfbc094963803f4b111d2e570455e6ef3f887","sha256:de7fc50ee39c6020839b9edb3c718eaeda622a2bdb76e3bab4fe64791cf77826"],"state_sha256":"2b90a26674c835e91f0003011dc719e1eaf3500f8a80371cc7ac55eb7b858eab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Teg5BalObLn/pOPhQCt6p4u+q41B9P1+8nDAAjpH6BC0nmd7bBKH77C3pJGuiLWadsQL59PB9iz+WC5HpoeOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:22:01.604772Z","bundle_sha256":"60b6302d2953f2dbe2e37a99532ece5e0bd7dbd794af9ea53d20b488aff97d4c"}}