{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6JN3OA2JOU5BWMJTTDHEEWDUMA","short_pith_number":"pith:6JN3OA2J","canonical_record":{"source":{"id":"1307.2139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-08T16:03:52Z","cross_cats_sorted":[],"title_canon_sha256":"55b37dbef6d489c89573ed3bf4d29df726a05da84e553e622c5dc8a2ff24a50d","abstract_canon_sha256":"d23978db43f2227f4b7338a0b45f79f851183c490ac2738e398d7b6d73e42f64"},"schema_version":"1.0"},"canonical_sha256":"f25bb70349753a1b313398ce4258746035ff71406fdb680cc30a85df762baa87","source":{"kind":"arxiv","id":"1307.2139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2139","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2139v1","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2139","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"6JN3OA2JOU5B","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6JN3OA2JOU5BWMJT","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6JN3OA2J","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6JN3OA2JOU5BWMJTTDHEEWDUMA","target":"record","payload":{"canonical_record":{"source":{"id":"1307.2139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-08T16:03:52Z","cross_cats_sorted":[],"title_canon_sha256":"55b37dbef6d489c89573ed3bf4d29df726a05da84e553e622c5dc8a2ff24a50d","abstract_canon_sha256":"d23978db43f2227f4b7338a0b45f79f851183c490ac2738e398d7b6d73e42f64"},"schema_version":"1.0"},"canonical_sha256":"f25bb70349753a1b313398ce4258746035ff71406fdb680cc30a85df762baa87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:02.307734Z","signature_b64":"EABD1QAZD1k/MgQIIqHwU8P75DhJdrYhRdgdO3oGokcy3mqCy1orR2JncHn+a81r1Fs26r3bSTbaAvi4HesbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f25bb70349753a1b313398ce4258746035ff71406fdb680cc30a85df762baa87","last_reissued_at":"2026-05-18T03:19:02.307347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:02.307347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.2139","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:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGMEnrF069BOFFP6MIRIkXGFJMRvPMg1OIv/Tjc95pzu/+sE7BozNVJZhGc65ODusJJUumj39/fQytgsniUqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:53:22.955036Z"},"content_sha256":"30b7937b71c0286fa69d1ddec291c92bd10d31e276fb1c609bb0b8bcf7d07b7e","schema_version":"1.0","event_id":"sha256:30b7937b71c0286fa69d1ddec291c92bd10d31e276fb1c609bb0b8bcf7d07b7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6JN3OA2JOU5BWMJTTDHEEWDUMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing [h,2,1] graphs by minimal forbidden induced subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Liliana Alc\\'on, Mar\\'ia P\\'ia Mazzoleni, Marisa Gutierrez","submitted_at":"2013-07-08T16:03:52Z","abstract_excerpt":"An undirected graph G is called a VPT graph if it is the vertex intersection graph of a family of paths in a tree. The class of graphs which admit a VPT representation in a host tree with maximum degree at most h is denoted by [h,2,1]. The classes [h,2,1] are closed by taking induced subgraphs, therefore each one can be characterized by a family of minimal forbidden induced subgraphs. In this paper we associate the minimal forbidden induced subgraphs for [h,2,1] which are VPT with (color) h-critical graphs. We describe how to obtain minimal forbidden induced subgraphs from critical graphs, eve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2139","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:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybOBkTCulVqXf2TQUsK8t/dQuqahgtweUdCuN6bW6plzptfWFsmfKk7fjQUIFYO/yhogU4hjJmGVovBZKhlUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:53:22.955686Z"},"content_sha256":"86fcf17d78f1147690158f9d9558b62e72e2f82b669b0c738cc910ee5af0ce76","schema_version":"1.0","event_id":"sha256:86fcf17d78f1147690158f9d9558b62e72e2f82b669b0c738cc910ee5af0ce76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JN3OA2JOU5BWMJTTDHEEWDUMA/bundle.json","state_url":"https://pith.science/pith/6JN3OA2JOU5BWMJTTDHEEWDUMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JN3OA2JOU5BWMJTTDHEEWDUMA/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-05T21:53:22Z","links":{"resolver":"https://pith.science/pith/6JN3OA2JOU5BWMJTTDHEEWDUMA","bundle":"https://pith.science/pith/6JN3OA2JOU5BWMJTTDHEEWDUMA/bundle.json","state":"https://pith.science/pith/6JN3OA2JOU5BWMJTTDHEEWDUMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JN3OA2JOU5BWMJTTDHEEWDUMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6JN3OA2JOU5BWMJTTDHEEWDUMA","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":"d23978db43f2227f4b7338a0b45f79f851183c490ac2738e398d7b6d73e42f64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-08T16:03:52Z","title_canon_sha256":"55b37dbef6d489c89573ed3bf4d29df726a05da84e553e622c5dc8a2ff24a50d"},"schema_version":"1.0","source":{"id":"1307.2139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2139","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2139v1","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2139","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"6JN3OA2JOU5B","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6JN3OA2JOU5BWMJT","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6JN3OA2J","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:86fcf17d78f1147690158f9d9558b62e72e2f82b669b0c738cc910ee5af0ce76","target":"graph","created_at":"2026-05-18T03:19:02Z","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":"An undirected graph G is called a VPT graph if it is the vertex intersection graph of a family of paths in a tree. The class of graphs which admit a VPT representation in a host tree with maximum degree at most h is denoted by [h,2,1]. The classes [h,2,1] are closed by taking induced subgraphs, therefore each one can be characterized by a family of minimal forbidden induced subgraphs. In this paper we associate the minimal forbidden induced subgraphs for [h,2,1] which are VPT with (color) h-critical graphs. We describe how to obtain minimal forbidden induced subgraphs from critical graphs, eve","authors_text":"Liliana Alc\\'on, Mar\\'ia P\\'ia Mazzoleni, Marisa Gutierrez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-08T16:03:52Z","title":"Characterizing [h,2,1] graphs by minimal forbidden induced subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2139","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:30b7937b71c0286fa69d1ddec291c92bd10d31e276fb1c609bb0b8bcf7d07b7e","target":"record","created_at":"2026-05-18T03:19:02Z","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":"d23978db43f2227f4b7338a0b45f79f851183c490ac2738e398d7b6d73e42f64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-08T16:03:52Z","title_canon_sha256":"55b37dbef6d489c89573ed3bf4d29df726a05da84e553e622c5dc8a2ff24a50d"},"schema_version":"1.0","source":{"id":"1307.2139","kind":"arxiv","version":1}},"canonical_sha256":"f25bb70349753a1b313398ce4258746035ff71406fdb680cc30a85df762baa87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f25bb70349753a1b313398ce4258746035ff71406fdb680cc30a85df762baa87","first_computed_at":"2026-05-18T03:19:02.307347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:02.307347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EABD1QAZD1k/MgQIIqHwU8P75DhJdrYhRdgdO3oGokcy3mqCy1orR2JncHn+a81r1Fs26r3bSTbaAvi4HesbBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:02.307734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30b7937b71c0286fa69d1ddec291c92bd10d31e276fb1c609bb0b8bcf7d07b7e","sha256:86fcf17d78f1147690158f9d9558b62e72e2f82b669b0c738cc910ee5af0ce76"],"state_sha256":"d90419926124c6a80963dcccff76407db05dc67939137daf089b1d523a4589f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXRrTdHWwDFyLE3p+gEfXLyYnuUQxCR1W2B90CagH0qTTefMqq/UpqNHdgqSF2v23P2zyg2ciRyexcEOefqOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:53:22.959166Z","bundle_sha256":"629e786b8b2d9e07b19c6df4d88499be6985c7cd72d12e9c44435400582681f4"}}