{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GAULMVEMZPUBXWXAYWOVLUAQMB","short_pith_number":"pith:GAULMVEM","schema_version":"1.0","canonical_sha256":"3028b6548ccbe81bdae0c59d55d0106054eb63afc8c72006a45237c7c8d3068f","source":{"kind":"arxiv","id":"1512.03781","version":3},"attestation_state":"computed","paper":{"title":"Tree sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Reinhard Diestel","submitted_at":"2015-12-11T20:06:55Z","abstract_excerpt":"We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and matroids etc.\n  Unlike graph-theoretical or order trees, these _tree sets_ can provide a suitable formalization of tree structure also for infinite graphs, matroids, and set partitions. Order trees reappear as oriented tree sets.\n  We show how each of the above structures defines a tree set, and which additional information, if any, is needed to reconstruct it"},"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":"1512.03781","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-11T20:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"f0109f60901bcd0c4003c370e0a51e479a058d35b29b50e53ffb7f7ab3549f96","abstract_canon_sha256":"b445f569dec62a10a353948cd82658895355e0ce4b01cba28ffaeb831ec4cf22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:01.756164Z","signature_b64":"MMbY9w7A8b0YIw3djodiMG1rmE9GHiQ24ynEzwSVkElXURIvLVRrYIyza9Ses3X6GfbTS+KfuhCsfSPIJkcrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3028b6548ccbe81bdae0c59d55d0106054eb63afc8c72006a45237c7c8d3068f","last_reissued_at":"2026-05-18T00:50:01.755574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:01.755574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Reinhard Diestel","submitted_at":"2015-12-11T20:06:55Z","abstract_excerpt":"We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and matroids etc.\n  Unlike graph-theoretical or order trees, these _tree sets_ can provide a suitable formalization of tree structure also for infinite graphs, matroids, and set partitions. Order trees reappear as oriented tree sets.\n  We show how each of the above structures defines a tree set, and which additional information, if any, is needed to reconstruct it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03781","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.03781","created_at":"2026-05-18T00:50:01.755668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03781v3","created_at":"2026-05-18T00:50:01.755668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03781","created_at":"2026-05-18T00:50:01.755668+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAULMVEMZPUB","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAULMVEMZPUBXWXA","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAULMVEM","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13656","citing_title":"On vertex sets inducing tangles","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GAULMVEMZPUBXWXAYWOVLUAQMB","json":"https://pith.science/pith/GAULMVEMZPUBXWXAYWOVLUAQMB.json","graph_json":"https://pith.science/api/pith-number/GAULMVEMZPUBXWXAYWOVLUAQMB/graph.json","events_json":"https://pith.science/api/pith-number/GAULMVEMZPUBXWXAYWOVLUAQMB/events.json","paper":"https://pith.science/paper/GAULMVEM"},"agent_actions":{"view_html":"https://pith.science/pith/GAULMVEMZPUBXWXAYWOVLUAQMB","download_json":"https://pith.science/pith/GAULMVEMZPUBXWXAYWOVLUAQMB.json","view_paper":"https://pith.science/paper/GAULMVEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03781&json=true","fetch_graph":"https://pith.science/api/pith-number/GAULMVEMZPUBXWXAYWOVLUAQMB/graph.json","fetch_events":"https://pith.science/api/pith-number/GAULMVEMZPUBXWXAYWOVLUAQMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAULMVEMZPUBXWXAYWOVLUAQMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAULMVEMZPUBXWXAYWOVLUAQMB/action/storage_attestation","attest_author":"https://pith.science/pith/GAULMVEMZPUBXWXAYWOVLUAQMB/action/author_attestation","sign_citation":"https://pith.science/pith/GAULMVEMZPUBXWXAYWOVLUAQMB/action/citation_signature","submit_replication":"https://pith.science/pith/GAULMVEMZPUBXWXAYWOVLUAQMB/action/replication_record"}},"created_at":"2026-05-18T00:50:01.755668+00:00","updated_at":"2026-05-18T00:50:01.755668+00:00"}