{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MX6U3TTUKWFR2VTUWH4YHDFEVS","short_pith_number":"pith:MX6U3TTU","canonical_record":{"source":{"id":"1207.5636","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T09:43:09Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"ea46e02c80ee93083a0b67aa83927e2d9315761590d1ba3da8c822218aa65854","abstract_canon_sha256":"d4c8f821c182ec629460dd595664cf70ec1ccdd945e6b766e43589a5d64632e0"},"schema_version":"1.0"},"canonical_sha256":"65fd4dce74558b1d5674b1f9838ca4acb77ac3150e4a4028626c942ef0849ae6","source":{"kind":"arxiv","id":"1207.5636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5636","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5636v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5636","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"MX6U3TTUKWFR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MX6U3TTUKWFR2VTU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MX6U3TTU","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MX6U3TTUKWFR2VTUWH4YHDFEVS","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5636","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T09:43:09Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"ea46e02c80ee93083a0b67aa83927e2d9315761590d1ba3da8c822218aa65854","abstract_canon_sha256":"d4c8f821c182ec629460dd595664cf70ec1ccdd945e6b766e43589a5d64632e0"},"schema_version":"1.0"},"canonical_sha256":"65fd4dce74558b1d5674b1f9838ca4acb77ac3150e4a4028626c942ef0849ae6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.068066Z","signature_b64":"HZV82LUUlNBZe3mJqzobEbHvafmMMaG8zDBPdNURZxgYdubxb99en7AtJDBHwb/mxhPhPc6kk119mzJ7eW2KAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65fd4dce74558b1d5674b1f9838ca4acb77ac3150e4a4028626c942ef0849ae6","last_reissued_at":"2026-05-18T02:21:08.067582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.067582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5636","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-18T02:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UCKtdaXa+3WPetOoet/dcoSnkZspMnNIgkwC1eKaIFaufvCRe+eDXKRgvKDmCID/w4hGnqs/hRo4l92dGgtaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:05:23.496691Z"},"content_sha256":"afae91924ecf630139961b25ff3b1bcb3c03d40e477acdcaa2533d10b397eb0c","schema_version":"1.0","event_id":"sha256:afae91924ecf630139961b25ff3b1bcb3c03d40e477acdcaa2533d10b397eb0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MX6U3TTUKWFR2VTUWH4YHDFEVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Computation of Immersion Obstructions for Unions of Graph Classes","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Archontia C. Giannopoulou, Dimitris Zoros, Iosif Salem","submitted_at":"2012-07-24T09:43:09Z","abstract_excerpt":"In the final paper of the Graph Minors series N. Robertson and P. Seymour proved that graphs are well-quasi-ordered under the immersion ordering. A direct implication of this theorem is that each class of graphs that is closed under taking immersions can be fully characterized by forbidding a finite set of graphs (immersion obstruction set). However, as the proof of the well-quasi-ordering theorem is non-constructive, there is no generic procedure for computing such a set. Moreover, it remains an open issue to identify for which immersion-closed graph classes the computation of those sets can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5636","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-18T02:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sv2jx5qPWToT+xaQ9ukjB7MYrcVCIPUBDvYZAn1putew+vSHajFRD/IeOp5LVN11+KePh+c9naLyZ1phFa0DCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:05:23.497042Z"},"content_sha256":"49bdaeff15d79c56de7c2f4a0f4f8b54fc67de4ac6f1419cde9ce2b15b533904","schema_version":"1.0","event_id":"sha256:49bdaeff15d79c56de7c2f4a0f4f8b54fc67de4ac6f1419cde9ce2b15b533904"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MX6U3TTUKWFR2VTUWH4YHDFEVS/bundle.json","state_url":"https://pith.science/pith/MX6U3TTUKWFR2VTUWH4YHDFEVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MX6U3TTUKWFR2VTUWH4YHDFEVS/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-21T23:05:23Z","links":{"resolver":"https://pith.science/pith/MX6U3TTUKWFR2VTUWH4YHDFEVS","bundle":"https://pith.science/pith/MX6U3TTUKWFR2VTUWH4YHDFEVS/bundle.json","state":"https://pith.science/pith/MX6U3TTUKWFR2VTUWH4YHDFEVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MX6U3TTUKWFR2VTUWH4YHDFEVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MX6U3TTUKWFR2VTUWH4YHDFEVS","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":"d4c8f821c182ec629460dd595664cf70ec1ccdd945e6b766e43589a5d64632e0","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T09:43:09Z","title_canon_sha256":"ea46e02c80ee93083a0b67aa83927e2d9315761590d1ba3da8c822218aa65854"},"schema_version":"1.0","source":{"id":"1207.5636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5636","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5636v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5636","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"MX6U3TTUKWFR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MX6U3TTUKWFR2VTU","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MX6U3TTU","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:49bdaeff15d79c56de7c2f4a0f4f8b54fc67de4ac6f1419cde9ce2b15b533904","target":"graph","created_at":"2026-05-18T02:21: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":"In the final paper of the Graph Minors series N. Robertson and P. Seymour proved that graphs are well-quasi-ordered under the immersion ordering. A direct implication of this theorem is that each class of graphs that is closed under taking immersions can be fully characterized by forbidding a finite set of graphs (immersion obstruction set). However, as the proof of the well-quasi-ordering theorem is non-constructive, there is no generic procedure for computing such a set. Moreover, it remains an open issue to identify for which immersion-closed graph classes the computation of those sets can ","authors_text":"Archontia C. Giannopoulou, Dimitris Zoros, Iosif Salem","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T09:43:09Z","title":"Effective Computation of Immersion Obstructions for Unions of Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5636","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:afae91924ecf630139961b25ff3b1bcb3c03d40e477acdcaa2533d10b397eb0c","target":"record","created_at":"2026-05-18T02:21: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":"d4c8f821c182ec629460dd595664cf70ec1ccdd945e6b766e43589a5d64632e0","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2012-07-24T09:43:09Z","title_canon_sha256":"ea46e02c80ee93083a0b67aa83927e2d9315761590d1ba3da8c822218aa65854"},"schema_version":"1.0","source":{"id":"1207.5636","kind":"arxiv","version":1}},"canonical_sha256":"65fd4dce74558b1d5674b1f9838ca4acb77ac3150e4a4028626c942ef0849ae6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65fd4dce74558b1d5674b1f9838ca4acb77ac3150e4a4028626c942ef0849ae6","first_computed_at":"2026-05-18T02:21:08.067582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:08.067582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HZV82LUUlNBZe3mJqzobEbHvafmMMaG8zDBPdNURZxgYdubxb99en7AtJDBHwb/mxhPhPc6kk119mzJ7eW2KAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:08.068066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afae91924ecf630139961b25ff3b1bcb3c03d40e477acdcaa2533d10b397eb0c","sha256:49bdaeff15d79c56de7c2f4a0f4f8b54fc67de4ac6f1419cde9ce2b15b533904"],"state_sha256":"7cd401359847362b2fa0b354688c84ed93e990c79faaf6c17aff45a06264cce3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yuvs90FT7kclYS+WPR94FXiZAzz4U/6CPy9sO2PDGdDItIaaRoAfPNJjCIwJAMuSXwk3Dbo9p4/YWDJ8m4B5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:05:23.498952Z","bundle_sha256":"27f5a3348e2b25d2aa1c3879975ebd75c258c4723c7ea45f5d61c67630c92ebc"}}