{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NHMW32K2FRLWL65YUCFGD5LLXA","short_pith_number":"pith:NHMW32K2","schema_version":"1.0","canonical_sha256":"69d96de95a2c5765fbb8a08a61f56bb81453d0b87df9129b29cd1674ff49c76d","source":{"kind":"arxiv","id":"2506.03603","version":1},"attestation_state":"computed","paper":{"title":"The vertex sets of subtrees of a tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour, Tung Nguyen","submitted_at":"2025-06-04T06:24:53Z","abstract_excerpt":"Let $\\mathcal{F}$ be a set of subsets of a set $W$. When is there a tree $T$ with vertex set $W$ such that each member of $\\mathcal{F}$ is the set of vertices of a subtree of $T$? It is necessary that $\\mathcal{F}$ has the Helly property and the intersection graph of $\\mathcal{F}$ is chordal. We will show that these two necessary conditions are together sufficient in the finite case, and more generally, they are sufficient if no element of $W$ belongs to infinitely many infinite sets in $\\mathcal{F}$."},"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":"2506.03603","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-04T06:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"155f6dab5f3a1c17df5900eda90e92ec7b2f43b6935bbc7df04689dbd95a6fed","abstract_canon_sha256":"4524d0243d03b4965c84be2780e5248852a4c9b0813aaafa1321aeaf59a69d2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:48.585565Z","signature_b64":"OWe+IrjVB/jkPaxSqHa3VN4VzNA6gILRdIsL93///cd/0I9he66WuhuP1bwrZGB1oQE4CLCQPXO1VYz6ljPJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69d96de95a2c5765fbb8a08a61f56bb81453d0b87df9129b29cd1674ff49c76d","last_reissued_at":"2026-07-05T11:15:48.585027Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:48.585027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The vertex sets of subtrees of a tree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour, Tung Nguyen","submitted_at":"2025-06-04T06:24:53Z","abstract_excerpt":"Let $\\mathcal{F}$ be a set of subsets of a set $W$. When is there a tree $T$ with vertex set $W$ such that each member of $\\mathcal{F}$ is the set of vertices of a subtree of $T$? It is necessary that $\\mathcal{F}$ has the Helly property and the intersection graph of $\\mathcal{F}$ is chordal. We will show that these two necessary conditions are together sufficient in the finite case, and more generally, they are sufficient if no element of $W$ belongs to infinitely many infinite sets in $\\mathcal{F}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03603","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/2506.03603/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":"2506.03603","created_at":"2026-07-05T11:15:48.585086+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03603v1","created_at":"2026-07-05T11:15:48.585086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03603","created_at":"2026-07-05T11:15:48.585086+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHMW32K2FRLW","created_at":"2026-07-05T11:15:48.585086+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHMW32K2FRLWL65Y","created_at":"2026-07-05T11:15:48.585086+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHMW32K2","created_at":"2026-07-05T11:15:48.585086+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA","json":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA.json","graph_json":"https://pith.science/api/pith-number/NHMW32K2FRLWL65YUCFGD5LLXA/graph.json","events_json":"https://pith.science/api/pith-number/NHMW32K2FRLWL65YUCFGD5LLXA/events.json","paper":"https://pith.science/paper/NHMW32K2"},"agent_actions":{"view_html":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA","download_json":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA.json","view_paper":"https://pith.science/paper/NHMW32K2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03603&json=true","fetch_graph":"https://pith.science/api/pith-number/NHMW32K2FRLWL65YUCFGD5LLXA/graph.json","fetch_events":"https://pith.science/api/pith-number/NHMW32K2FRLWL65YUCFGD5LLXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA/action/storage_attestation","attest_author":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA/action/author_attestation","sign_citation":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA/action/citation_signature","submit_replication":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA/action/replication_record"}},"created_at":"2026-07-05T11:15:48.585086+00:00","updated_at":"2026-07-05T11:15:48.585086+00:00"}