{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UGLSW7GRN3QURN4ZY4CTH56U4J","short_pith_number":"pith:UGLSW7GR","canonical_record":{"source":{"id":"1205.2535","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-11T14:22:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"28bbe12feb4cc0eb9957960ed6043d6e0915a66a5fe69c8d43afa2967d648fd4","abstract_canon_sha256":"368cea6afe0af6227e8d53a5454e35458b35dd3e342e31e23488195d5ded7174"},"schema_version":"1.0"},"canonical_sha256":"a1972b7cd16ee148b799c70533f7d4e2653ee11e93d2d06d7483fe38e9b944ec","source":{"kind":"arxiv","id":"1205.2535","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2535","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2535v3","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2535","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"UGLSW7GRN3QU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UGLSW7GRN3QURN4Z","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UGLSW7GR","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UGLSW7GRN3QURN4ZY4CTH56U4J","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2535","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-11T14:22:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"28bbe12feb4cc0eb9957960ed6043d6e0915a66a5fe69c8d43afa2967d648fd4","abstract_canon_sha256":"368cea6afe0af6227e8d53a5454e35458b35dd3e342e31e23488195d5ded7174"},"schema_version":"1.0"},"canonical_sha256":"a1972b7cd16ee148b799c70533f7d4e2653ee11e93d2d06d7483fe38e9b944ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:54.253834Z","signature_b64":"GGHthG1J8nSGBoIT2h7EH2pX88PVYJVaU9aj4g2TZ0H2/ScC7D6D64T6aTskmcy7Gcy/85njLzuD/2yyOPjLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1972b7cd16ee148b799c70533f7d4e2653ee11e93d2d06d7483fe38e9b944ec","last_reissued_at":"2026-05-18T02:28:54.253494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:54.253494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2535","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-18T02:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KcSiBBBRyqIK19D638agcRutYzbMedF0EKCMFeRoVuSkWIO3IFvcDk5KtfKfjCnBp7AyhgpHfaBKlViidaNrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:25:17.779268Z"},"content_sha256":"700b972482304f69e1d4b10b40859abb042491c6c50f3209a821d39037a72f0b","schema_version":"1.0","event_id":"sha256:700b972482304f69e1d4b10b40859abb042491c6c50f3209a821d39037a72f0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UGLSW7GRN3QURN4ZY4CTH56U4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex elimination orderings for hereditary graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Kristina Vuskovic, Nicolas Trotignon, Pierre Aboulker, Pierre Charbit","submitted_at":"2012-05-11T14:22:12Z","abstract_excerpt":"We provide a general method to prove the existence and compute efficiently elimination orderings in graphs. Our method relies on several tools that were known before, but that were not put together so far: the algorithm LexBFS due to Rose, Tarjan and Lueker, one of its properties discovered by Berry and Bordat, and a local decomposition property of graphs discovered by Maffray, Trotignon and Vu\\vskovi\\'c. We use this method to prove the existence of elimination orderings in several classes of graphs, and to compute them in linear time. Some of the classes have already been studied, namely even"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2535","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-18T02:28:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iuvRhAmuk4wVFmPiTpF+exQWqFRMBYEIBlxAGmSz8u9XgZDVvzNGNAnmXwOiaDIs8F2+OfpydZGSg7KQZZT+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:25:17.779637Z"},"content_sha256":"5991044bd4c53a1e2d3632fef132169ea94786410807d40e5776cb44d16acf44","schema_version":"1.0","event_id":"sha256:5991044bd4c53a1e2d3632fef132169ea94786410807d40e5776cb44d16acf44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGLSW7GRN3QURN4ZY4CTH56U4J/bundle.json","state_url":"https://pith.science/pith/UGLSW7GRN3QURN4ZY4CTH56U4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGLSW7GRN3QURN4ZY4CTH56U4J/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-04T20:25:17Z","links":{"resolver":"https://pith.science/pith/UGLSW7GRN3QURN4ZY4CTH56U4J","bundle":"https://pith.science/pith/UGLSW7GRN3QURN4ZY4CTH56U4J/bundle.json","state":"https://pith.science/pith/UGLSW7GRN3QURN4ZY4CTH56U4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGLSW7GRN3QURN4ZY4CTH56U4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UGLSW7GRN3QURN4ZY4CTH56U4J","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":"368cea6afe0af6227e8d53a5454e35458b35dd3e342e31e23488195d5ded7174","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-11T14:22:12Z","title_canon_sha256":"28bbe12feb4cc0eb9957960ed6043d6e0915a66a5fe69c8d43afa2967d648fd4"},"schema_version":"1.0","source":{"id":"1205.2535","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2535","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2535v3","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2535","created_at":"2026-05-18T02:28:54Z"},{"alias_kind":"pith_short_12","alias_value":"UGLSW7GRN3QU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UGLSW7GRN3QURN4Z","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UGLSW7GR","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:5991044bd4c53a1e2d3632fef132169ea94786410807d40e5776cb44d16acf44","target":"graph","created_at":"2026-05-18T02:28:54Z","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 provide a general method to prove the existence and compute efficiently elimination orderings in graphs. Our method relies on several tools that were known before, but that were not put together so far: the algorithm LexBFS due to Rose, Tarjan and Lueker, one of its properties discovered by Berry and Bordat, and a local decomposition property of graphs discovered by Maffray, Trotignon and Vu\\vskovi\\'c. We use this method to prove the existence of elimination orderings in several classes of graphs, and to compute them in linear time. Some of the classes have already been studied, namely even","authors_text":"Kristina Vuskovic, Nicolas Trotignon, Pierre Aboulker, Pierre Charbit","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-11T14:22:12Z","title":"Vertex elimination orderings for hereditary graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2535","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:700b972482304f69e1d4b10b40859abb042491c6c50f3209a821d39037a72f0b","target":"record","created_at":"2026-05-18T02:28:54Z","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":"368cea6afe0af6227e8d53a5454e35458b35dd3e342e31e23488195d5ded7174","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-11T14:22:12Z","title_canon_sha256":"28bbe12feb4cc0eb9957960ed6043d6e0915a66a5fe69c8d43afa2967d648fd4"},"schema_version":"1.0","source":{"id":"1205.2535","kind":"arxiv","version":3}},"canonical_sha256":"a1972b7cd16ee148b799c70533f7d4e2653ee11e93d2d06d7483fe38e9b944ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1972b7cd16ee148b799c70533f7d4e2653ee11e93d2d06d7483fe38e9b944ec","first_computed_at":"2026-05-18T02:28:54.253494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:54.253494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GGHthG1J8nSGBoIT2h7EH2pX88PVYJVaU9aj4g2TZ0H2/ScC7D6D64T6aTskmcy7Gcy/85njLzuD/2yyOPjLCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:54.253834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2535","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:700b972482304f69e1d4b10b40859abb042491c6c50f3209a821d39037a72f0b","sha256:5991044bd4c53a1e2d3632fef132169ea94786410807d40e5776cb44d16acf44"],"state_sha256":"7527d4976faa6a5d3f8e1d814bdb02d26ad332e2ea764f2064bcfd0bdd397fb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVy+0mTQyVFRn6DBI5QyUjsUzobN/kzdXzW5PhjDE4iZfuleGoaY5Fkk9G2OJ6Spb0TMv/jQ5UEOcQliYWuiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:25:17.781811Z","bundle_sha256":"aeba5471f6fd75067432dd1b0ebd1a402cb7e39cc9d4bfd5e325065f8a5daa7d"}}