{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:637KFPRHC5G6DNBLWV6HQCMCVE","short_pith_number":"pith:637KFPRH","schema_version":"1.0","canonical_sha256":"f6fea2be27174de1b42bb57c780982a93c179ecf915dff0600392f94ae1b7618","source":{"kind":"arxiv","id":"1409.6640","version":5},"attestation_state":"computed","paper":{"title":"All graphs have tree-decompositions displaying their topological ends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin","submitted_at":"2014-09-23T15:44:02Z","abstract_excerpt":"We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992."},"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":"1409.6640","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-23T15:44:02Z","cross_cats_sorted":[],"title_canon_sha256":"32eab24a8e1c6350526495c85932075da6afa1df286ed251d6ff8d2c190f5044","abstract_canon_sha256":"66495c3cd919301adaf5997bb20e4c99ab0947769c9d6ff7789e1e31813feb4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:25.473923Z","signature_b64":"Qo7x7UkbnAG7RdEP1uqZ4sPhfa+nnD5mMNyLIFqWmtzXAbLrnd7BAjpdxZ0ONLN87ev2P0Fly5xvrntOZ0cnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6fea2be27174de1b42bb57c780982a93c179ecf915dff0600392f94ae1b7618","last_reissued_at":"2026-05-18T00:24:25.473255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:25.473255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All graphs have tree-decompositions displaying their topological ends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johannes Carmesin","submitted_at":"2014-09-23T15:44:02Z","abstract_excerpt":"We show that every connected graph has a spanning tree that displays all its topological ends. This proves a 1964 conjecture of Halin in corrected form, and settles a problem of Diestel from 1992."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6640","kind":"arxiv","version":5},"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":"1409.6640","created_at":"2026-05-18T00:24:25.473368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6640v5","created_at":"2026-05-18T00:24:25.473368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6640","created_at":"2026-05-18T00:24:25.473368+00:00"},{"alias_kind":"pith_short_12","alias_value":"637KFPRHC5G6","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"637KFPRHC5G6DNBL","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"637KFPRH","created_at":"2026-05-18T12:28:16.859392+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/637KFPRHC5G6DNBLWV6HQCMCVE","json":"https://pith.science/pith/637KFPRHC5G6DNBLWV6HQCMCVE.json","graph_json":"https://pith.science/api/pith-number/637KFPRHC5G6DNBLWV6HQCMCVE/graph.json","events_json":"https://pith.science/api/pith-number/637KFPRHC5G6DNBLWV6HQCMCVE/events.json","paper":"https://pith.science/paper/637KFPRH"},"agent_actions":{"view_html":"https://pith.science/pith/637KFPRHC5G6DNBLWV6HQCMCVE","download_json":"https://pith.science/pith/637KFPRHC5G6DNBLWV6HQCMCVE.json","view_paper":"https://pith.science/paper/637KFPRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6640&json=true","fetch_graph":"https://pith.science/api/pith-number/637KFPRHC5G6DNBLWV6HQCMCVE/graph.json","fetch_events":"https://pith.science/api/pith-number/637KFPRHC5G6DNBLWV6HQCMCVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/637KFPRHC5G6DNBLWV6HQCMCVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/637KFPRHC5G6DNBLWV6HQCMCVE/action/storage_attestation","attest_author":"https://pith.science/pith/637KFPRHC5G6DNBLWV6HQCMCVE/action/author_attestation","sign_citation":"https://pith.science/pith/637KFPRHC5G6DNBLWV6HQCMCVE/action/citation_signature","submit_replication":"https://pith.science/pith/637KFPRHC5G6DNBLWV6HQCMCVE/action/replication_record"}},"created_at":"2026-05-18T00:24:25.473368+00:00","updated_at":"2026-05-18T00:24:25.473368+00:00"}