{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NHMW32K2FRLWL65YUCFGD5LLXA","short_pith_number":"pith:NHMW32K2","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"},"canonical_sha256":"69d96de95a2c5765fbb8a08a61f56bb81453d0b87df9129b29cd1674ff49c76d","source":{"kind":"arxiv","id":"2506.03603","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03603","created_at":"2026-07-05T11:15:48Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03603v1","created_at":"2026-07-05T11:15:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03603","created_at":"2026-07-05T11:15:48Z"},{"alias_kind":"pith_short_12","alias_value":"NHMW32K2FRLW","created_at":"2026-07-05T11:15:48Z"},{"alias_kind":"pith_short_16","alias_value":"NHMW32K2FRLWL65Y","created_at":"2026-07-05T11:15:48Z"},{"alias_kind":"pith_short_8","alias_value":"NHMW32K2","created_at":"2026-07-05T11:15:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NHMW32K2FRLWL65YUCFGD5LLXA","target":"record","payload":{"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"},"canonical_sha256":"69d96de95a2c5765fbb8a08a61f56bb81453d0b87df9129b29cd1674ff49c76d","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"},"source_kind":"arxiv","source_id":"2506.03603","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-07-05T11:15:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6LVFEaFnN65+6U3ZJyr8gsYfojrPIv5E89WeXKMj3uDWeb7Bu7R/X88MWIQ41LGkEnlaMNCBnZmSQrQT/V4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:13:02.776426Z"},"content_sha256":"df5238c7cfa1ca06b5cc015f679942b0d4609b10d6c94c498b038878fa49a773","schema_version":"1.0","event_id":"sha256:df5238c7cfa1ca06b5cc015f679942b0d4609b10d6c94c498b038878fa49a773"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NHMW32K2FRLWL65YUCFGD5LLXA","target":"graph","payload":{"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"},"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-07-05T11:15:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3zdlpcQ/xOjS8tQ67OswvsOMSQFrxuGXqXFiWjeX3jNkPnWFD2Xi4xVs9IpVML20UqBrQwoaVkBQO0r5i87AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:13:02.776931Z"},"content_sha256":"476a215de5d1a8ff070d59e68b063e1f3aac58c97e349e281dba003e50f9a5d2","schema_version":"1.0","event_id":"sha256:476a215de5d1a8ff070d59e68b063e1f3aac58c97e349e281dba003e50f9a5d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA/bundle.json","state_url":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHMW32K2FRLWL65YUCFGD5LLXA/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-08-08T01:13:02Z","links":{"resolver":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA","bundle":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA/bundle.json","state":"https://pith.science/pith/NHMW32K2FRLWL65YUCFGD5LLXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHMW32K2FRLWL65YUCFGD5LLXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NHMW32K2FRLWL65YUCFGD5LLXA","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":"4524d0243d03b4965c84be2780e5248852a4c9b0813aaafa1321aeaf59a69d2f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-04T06:24:53Z","title_canon_sha256":"155f6dab5f3a1c17df5900eda90e92ec7b2f43b6935bbc7df04689dbd95a6fed"},"schema_version":"1.0","source":{"id":"2506.03603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03603","created_at":"2026-07-05T11:15:48Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03603v1","created_at":"2026-07-05T11:15:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03603","created_at":"2026-07-05T11:15:48Z"},{"alias_kind":"pith_short_12","alias_value":"NHMW32K2FRLW","created_at":"2026-07-05T11:15:48Z"},{"alias_kind":"pith_short_16","alias_value":"NHMW32K2FRLWL65Y","created_at":"2026-07-05T11:15:48Z"},{"alias_kind":"pith_short_8","alias_value":"NHMW32K2","created_at":"2026-07-05T11:15:48Z"}],"graph_snapshots":[{"event_id":"sha256:476a215de5d1a8ff070d59e68b063e1f3aac58c97e349e281dba003e50f9a5d2","target":"graph","created_at":"2026-07-05T11:15:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.03603/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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}$.","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour, Tung Nguyen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03603","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:df5238c7cfa1ca06b5cc015f679942b0d4609b10d6c94c498b038878fa49a773","target":"record","created_at":"2026-07-05T11:15:48Z","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":"4524d0243d03b4965c84be2780e5248852a4c9b0813aaafa1321aeaf59a69d2f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-04T06:24:53Z","title_canon_sha256":"155f6dab5f3a1c17df5900eda90e92ec7b2f43b6935bbc7df04689dbd95a6fed"},"schema_version":"1.0","source":{"id":"2506.03603","kind":"arxiv","version":1}},"canonical_sha256":"69d96de95a2c5765fbb8a08a61f56bb81453d0b87df9129b29cd1674ff49c76d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69d96de95a2c5765fbb8a08a61f56bb81453d0b87df9129b29cd1674ff49c76d","first_computed_at":"2026-07-05T11:15:48.585027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:48.585027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OWe+IrjVB/jkPaxSqHa3VN4VzNA6gILRdIsL93///cd/0I9he66WuhuP1bwrZGB1oQE4CLCQPXO1VYz6ljPJAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:48.585565Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df5238c7cfa1ca06b5cc015f679942b0d4609b10d6c94c498b038878fa49a773","sha256:476a215de5d1a8ff070d59e68b063e1f3aac58c97e349e281dba003e50f9a5d2"],"state_sha256":"980c2771561cf1d7cc0bd8a031d4d5c7a3244b6f036e18b97f490cfd64de5258"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z4q9pCZHXQvORWsKI9CneM1gdCV2ExtAxVIoxh8RuO6zbwd3bSBxh7ijWoXV9pW6XZVHI48/e6CZfUqQAdvXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T01:13:02.780805Z","bundle_sha256":"f7356359396e9df3a6fdd53f5a7ef31116c8923c808e51748c640ed0e37e9a50"}}