{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XZCKYCG652IIHPITIMQTBHW46W","short_pith_number":"pith:XZCKYCG6","canonical_record":{"source":{"id":"1207.6141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-25T22:48:23Z","cross_cats_sorted":[],"title_canon_sha256":"c932bbc7dca1553c6389d499454165e224a2a8ad051781a09d16d4283365f4fe","abstract_canon_sha256":"5cff955ae723042245bceb4f87e783639a29f9d18444a9e9ef5dbd1bc76394d0"},"schema_version":"1.0"},"canonical_sha256":"be44ac08deee9083bd134321309edcf5998fe2c80cc76e7c7797f4ad44cdef9f","source":{"kind":"arxiv","id":"1207.6141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6141","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6141v1","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6141","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"XZCKYCG652II","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XZCKYCG652IIHPIT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XZCKYCG6","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XZCKYCG652IIHPITIMQTBHW46W","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-25T22:48:23Z","cross_cats_sorted":[],"title_canon_sha256":"c932bbc7dca1553c6389d499454165e224a2a8ad051781a09d16d4283365f4fe","abstract_canon_sha256":"5cff955ae723042245bceb4f87e783639a29f9d18444a9e9ef5dbd1bc76394d0"},"schema_version":"1.0"},"canonical_sha256":"be44ac08deee9083bd134321309edcf5998fe2c80cc76e7c7797f4ad44cdef9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:08.748123Z","signature_b64":"C7FyudFe1Ialz5QwSJQ6C9OLX00Vkp2pjF/EBxDdpNeko+rPXI/pp1CDjn98CU8l8B5nkF3ACFn21G1+E1+9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be44ac08deee9083bd134321309edcf5998fe2c80cc76e7c7797f4ad44cdef9f","last_reissued_at":"2026-05-18T03:50:08.747290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:08.747290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6141","source_version":1,"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:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnYNRUuFZNce8rq9gFckPK//tnfOrhK/4VnZDqCtuyUEEt5871rF0ir1qDYoeZDCR4dkAjPYHg9tuA/7brwGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:58:23.639382Z"},"content_sha256":"97bf539e0880cba0a2307cea6b3408b4740d2ede47f232db1359e20886526418","schema_version":"1.0","event_id":"sha256:97bf539e0880cba0a2307cea6b3408b4740d2ede47f232db1359e20886526418"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XZCKYCG652IIHPITIMQTBHW46W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding minors in graphs with a given path structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'e K\\\"undgen, Michael J. Pelsmajer, Radhika Ramamurthi","submitted_at":"2012-07-25T22:48:23Z","abstract_excerpt":"Given graphs G and H with V(G) containing V(H), suppose that we have a u,v-path P_{uv} in G for each edge uv in H. There are obvious additional conditions that ensure that G contains H as a rooted subgraph, subdivision, or immersion; we seek conditions that ensure that G contains H as a rooted minor or minor. This naturally leads to studying sets of paths that form an H-immersion, with the additional property that paths that contain the same vertex must have a common endpoint. We say that $H$ is contractible if, whenever G contains such an H-immersion, G must also contain a rooted H-minor. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6141","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"},"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:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZaIP9bIeSU+6JRd7LskYL5Bv/HZF3tkHonlNjxgPJ4gM2UzjhVdft70PdtjIYGols+AdxgM9R1fijhHpM44eCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:58:23.639734Z"},"content_sha256":"3f7c85c38422247993053e794fa1f914b0380de543343f9554936a798ed200c4","schema_version":"1.0","event_id":"sha256:3f7c85c38422247993053e794fa1f914b0380de543343f9554936a798ed200c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZCKYCG652IIHPITIMQTBHW46W/bundle.json","state_url":"https://pith.science/pith/XZCKYCG652IIHPITIMQTBHW46W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZCKYCG652IIHPITIMQTBHW46W/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-03T20:58:23Z","links":{"resolver":"https://pith.science/pith/XZCKYCG652IIHPITIMQTBHW46W","bundle":"https://pith.science/pith/XZCKYCG652IIHPITIMQTBHW46W/bundle.json","state":"https://pith.science/pith/XZCKYCG652IIHPITIMQTBHW46W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZCKYCG652IIHPITIMQTBHW46W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XZCKYCG652IIHPITIMQTBHW46W","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":"5cff955ae723042245bceb4f87e783639a29f9d18444a9e9ef5dbd1bc76394d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-25T22:48:23Z","title_canon_sha256":"c932bbc7dca1553c6389d499454165e224a2a8ad051781a09d16d4283365f4fe"},"schema_version":"1.0","source":{"id":"1207.6141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6141","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6141v1","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6141","created_at":"2026-05-18T03:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"XZCKYCG652II","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XZCKYCG652IIHPIT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XZCKYCG6","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:3f7c85c38422247993053e794fa1f914b0380de543343f9554936a798ed200c4","target":"graph","created_at":"2026-05-18T03:50:08Z","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":"Given graphs G and H with V(G) containing V(H), suppose that we have a u,v-path P_{uv} in G for each edge uv in H. There are obvious additional conditions that ensure that G contains H as a rooted subgraph, subdivision, or immersion; we seek conditions that ensure that G contains H as a rooted minor or minor. This naturally leads to studying sets of paths that form an H-immersion, with the additional property that paths that contain the same vertex must have a common endpoint. We say that $H$ is contractible if, whenever G contains such an H-immersion, G must also contain a rooted H-minor. We ","authors_text":"Andr\\'e K\\\"undgen, Michael J. Pelsmajer, Radhika Ramamurthi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-25T22:48:23Z","title":"Finding minors in graphs with a given path structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6141","kind":"arxiv","version":1},"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:97bf539e0880cba0a2307cea6b3408b4740d2ede47f232db1359e20886526418","target":"record","created_at":"2026-05-18T03:50:08Z","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":"5cff955ae723042245bceb4f87e783639a29f9d18444a9e9ef5dbd1bc76394d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-25T22:48:23Z","title_canon_sha256":"c932bbc7dca1553c6389d499454165e224a2a8ad051781a09d16d4283365f4fe"},"schema_version":"1.0","source":{"id":"1207.6141","kind":"arxiv","version":1}},"canonical_sha256":"be44ac08deee9083bd134321309edcf5998fe2c80cc76e7c7797f4ad44cdef9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be44ac08deee9083bd134321309edcf5998fe2c80cc76e7c7797f4ad44cdef9f","first_computed_at":"2026-05-18T03:50:08.747290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:08.747290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C7FyudFe1Ialz5QwSJQ6C9OLX00Vkp2pjF/EBxDdpNeko+rPXI/pp1CDjn98CU8l8B5nkF3ACFn21G1+E1+9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:08.748123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97bf539e0880cba0a2307cea6b3408b4740d2ede47f232db1359e20886526418","sha256:3f7c85c38422247993053e794fa1f914b0380de543343f9554936a798ed200c4"],"state_sha256":"6c574e3dee29e5ab2a4d29f80084516416177148de8ab5678158399ba1e7e264"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74bsynNoOGmRtUI9em4lpi5UG3GSQBbDEfcKSGm3VqsG7dRPumuJbuaT40ak+wELpYMTVTKIbCu90twz89KcDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:58:23.641798Z","bundle_sha256":"c755bd863e6fdb94b3325e8543e91abd753bd474a256926c06f371b6ecd3692a"}}