{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LJVFQMHHQ4JXAWAWAIWZM2BR7Q","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":"98253dacdb7c36cb867110c6c792962d3b4b28581af0a546763c915c4e165bb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-27T16:57:40Z","title_canon_sha256":"1afbf6f7d567c9a57f071cb360dd3c4cb46088b299b69835798d27265a671f51"},"schema_version":"1.0","source":{"id":"1908.10327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.10327","created_at":"2026-07-05T11:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1908.10327v1","created_at":"2026-07-05T11:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.10327","created_at":"2026-07-05T11:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"LJVFQMHHQ4JX","created_at":"2026-07-05T11:03:44Z"},{"alias_kind":"pith_short_16","alias_value":"LJVFQMHHQ4JXAWAW","created_at":"2026-07-05T11:03:44Z"},{"alias_kind":"pith_short_8","alias_value":"LJVFQMHH","created_at":"2026-07-05T11:03:44Z"}],"graph_snapshots":[{"event_id":"sha256:e05e530a427c3fe3340ad479dc4029ca0045f1f71c269f1bc9f03d5614a46e88","target":"graph","created_at":"2026-07-05T11:03:44Z","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/1908.10327/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.\n  First we characterise those tree sets that can be represented by tree sets arising from infinite trees; these are precisely those tree sets without a chain of order type ${\\omega+1}$. Then we introduce and study a topological generalisation of infinite trees which can have limit edges, and show that every infinite tree set can be represented by the tree set a","authors_text":"Jay Lilian Kneip, J. Pascal Gollin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-27T16:57:40Z","title":"Representations of infinite tree-sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.10327","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:d980dfc07003d3cb0d9fd2c872933ba8865205568fc83a98c3625758322a79f0","target":"record","created_at":"2026-07-05T11:03:44Z","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":"98253dacdb7c36cb867110c6c792962d3b4b28581af0a546763c915c4e165bb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-27T16:57:40Z","title_canon_sha256":"1afbf6f7d567c9a57f071cb360dd3c4cb46088b299b69835798d27265a671f51"},"schema_version":"1.0","source":{"id":"1908.10327","kind":"arxiv","version":1}},"canonical_sha256":"5a6a5830e78713705816022d966831fc24f12481c72cb77493a0831589fdf432","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a6a5830e78713705816022d966831fc24f12481c72cb77493a0831589fdf432","first_computed_at":"2026-07-05T11:03:44.013978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:03:44.013978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bp4hBib9wHZTp/aeiJjbaweEszFbj5JnsFfZQ7dtxHwznnOxeZAceV0DotjeunR78bXxQaflhvZZwaD89Oh4Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:03:44.014486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.10327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d980dfc07003d3cb0d9fd2c872933ba8865205568fc83a98c3625758322a79f0","sha256:e05e530a427c3fe3340ad479dc4029ca0045f1f71c269f1bc9f03d5614a46e88"],"state_sha256":"6ff2826f02c86bf8cf102ec34c471acf9bdf74c522baf688af7566673700429a"}