{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:T4HUFCZ33PMLWKNSNKDVJ64TTF","short_pith_number":"pith:T4HUFCZ3","schema_version":"1.0","canonical_sha256":"9f0f428b3bdbd8bb29b26a8754fb93995171122c76754c20dd9ec946b0551850","source":{"kind":"arxiv","id":"math/0512218","version":1},"attestation_state":"computed","paper":{"title":"Universal graphs with a forbidden subtree","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Gregory Cherlin, Saharon Shelah","submitted_at":"2005-12-10T22:06:40Z","abstract_excerpt":"We show that the problem of the existence of universal graphs with specified forbidden subgraphs can be systematically reduced to certain critical cases by a simple pruning technique which simplifies the underlying structure of the forbidden graphs, viewed as trees of blocks. As an application, we characterize the trees T for which a universal countable T-free graph exists."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"math/0512218","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.LO","submitted_at":"2005-12-10T22:06:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fff8d9cac133c9b479d09d6fb19cfba63a4bc4e9a815842d29fcffdb27e36c05","abstract_canon_sha256":"2489dfe03840ca06a7600ea4615e81c67160ed3fa84c5271a78446e1cb9942a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:52:14.003271Z","signature_b64":"7UZEo2h3QR/RmnaovrxXqnkB0PFcGHG8z/XK10JmkQdB+wVxeroyd2+6Bwz6ycHJetoogwSOW57w1xzZXqB3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f0f428b3bdbd8bb29b26a8754fb93995171122c76754c20dd9ec946b0551850","last_reissued_at":"2026-07-04T14:52:14.002890Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:52:14.002890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal graphs with a forbidden subtree","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Gregory Cherlin, Saharon Shelah","submitted_at":"2005-12-10T22:06:40Z","abstract_excerpt":"We show that the problem of the existence of universal graphs with specified forbidden subgraphs can be systematically reduced to certain critical cases by a simple pruning technique which simplifies the underlying structure of the forbidden graphs, viewed as trees of blocks. As an application, we characterize the trees T for which a universal countable T-free graph exists."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0512218","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0512218/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0512218","created_at":"2026-07-04T14:52:14.002958+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0512218v1","created_at":"2026-07-04T14:52:14.002958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0512218","created_at":"2026-07-04T14:52:14.002958+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4HUFCZ33PML","created_at":"2026-07-04T14:52:14.002958+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4HUFCZ33PMLWKNS","created_at":"2026-07-04T14:52:14.002958+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4HUFCZ3","created_at":"2026-07-04T14:52:14.002958+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.17820","citing_title":"Smaller universal posets","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T4HUFCZ33PMLWKNSNKDVJ64TTF","json":"https://pith.science/pith/T4HUFCZ33PMLWKNSNKDVJ64TTF.json","graph_json":"https://pith.science/api/pith-number/T4HUFCZ33PMLWKNSNKDVJ64TTF/graph.json","events_json":"https://pith.science/api/pith-number/T4HUFCZ33PMLWKNSNKDVJ64TTF/events.json","paper":"https://pith.science/paper/T4HUFCZ3"},"agent_actions":{"view_html":"https://pith.science/pith/T4HUFCZ33PMLWKNSNKDVJ64TTF","download_json":"https://pith.science/pith/T4HUFCZ33PMLWKNSNKDVJ64TTF.json","view_paper":"https://pith.science/paper/T4HUFCZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0512218&json=true","fetch_graph":"https://pith.science/api/pith-number/T4HUFCZ33PMLWKNSNKDVJ64TTF/graph.json","fetch_events":"https://pith.science/api/pith-number/T4HUFCZ33PMLWKNSNKDVJ64TTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4HUFCZ33PMLWKNSNKDVJ64TTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4HUFCZ33PMLWKNSNKDVJ64TTF/action/storage_attestation","attest_author":"https://pith.science/pith/T4HUFCZ33PMLWKNSNKDVJ64TTF/action/author_attestation","sign_citation":"https://pith.science/pith/T4HUFCZ33PMLWKNSNKDVJ64TTF/action/citation_signature","submit_replication":"https://pith.science/pith/T4HUFCZ33PMLWKNSNKDVJ64TTF/action/replication_record"}},"created_at":"2026-07-04T14:52:14.002958+00:00","updated_at":"2026-07-04T14:52:14.002958+00:00"}