{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MPXTXFQOFWOLSMGRXB3772FZUM","short_pith_number":"pith:MPXTXFQO","canonical_record":{"source":{"id":"1805.09506","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-05-24T04:53:07Z","cross_cats_sorted":["math.DS","math.LO"],"title_canon_sha256":"d76b7609cfdc6e0d53084a0bc7159cb99520177ac619a2141872348b40da783f","abstract_canon_sha256":"eb6e86b44320a7928710091bbef6ee81125f3cd31892f2e48ef2299a4b85c7f3"},"schema_version":"1.0"},"canonical_sha256":"63ef3b960e2d9cb930d1b877ffe8b9a33f417abd693d279baeacfeed52789151","source":{"kind":"arxiv","id":"1805.09506","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09506","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09506v4","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09506","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"MPXTXFQOFWOL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MPXTXFQOFWOLSMGR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MPXTXFQO","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MPXTXFQOFWOLSMGRXB3772FZUM","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09506","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-05-24T04:53:07Z","cross_cats_sorted":["math.DS","math.LO"],"title_canon_sha256":"d76b7609cfdc6e0d53084a0bc7159cb99520177ac619a2141872348b40da783f","abstract_canon_sha256":"eb6e86b44320a7928710091bbef6ee81125f3cd31892f2e48ef2299a4b85c7f3"},"schema_version":"1.0"},"canonical_sha256":"63ef3b960e2d9cb930d1b877ffe8b9a33f417abd693d279baeacfeed52789151","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:43.035091Z","signature_b64":"Q1VyQGzSAWmf6J7jbz85bmGybBSXCJ8Vt3AUpa0xrsUvEfJbRC2vVu+QjZFGPWoiVv6hpN5RP7ZQSFRb2i8vDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63ef3b960e2d9cb930d1b877ffe8b9a33f417abd693d279baeacfeed52789151","last_reissued_at":"2026-05-18T00:12:43.034375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:43.034375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09506","source_version":4,"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-05-18T00:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cbl9k4B9j+m1mI86tBh8x+DGgpL3xxMLIk4C2Yra+oScdcdjHabJAwOLhwOPw0mcQM0Z03WqdGGD9PhrjILQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:18:51.554225Z"},"content_sha256":"d4a5ce596c0b52905b9ada3e38e06cf4532b3fcc9b14a70fcdbb346a4467f7df","schema_version":"1.0","event_id":"sha256:d4a5ce596c0b52905b9ada3e38e06cf4532b3fcc9b14a70fcdbb346a4467f7df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MPXTXFQOFWOLSMGRXB3772FZUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A descriptive construction of trees and Stallings' theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.LO"],"primary_cat":"math.GR","authors_text":"Anush Tserunyan","submitted_at":"2018-05-24T04:53:07Z","abstract_excerpt":"We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws ideas from a paper of Kr\\\"{o}n, it is written in a way that easily adapts to the setting of countable Borel equivalence relations, leading to a free decomposition result and a sufficient condition for treeability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09506","kind":"arxiv","version":4},"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"},"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-05-18T00:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skLFAIYwEqe1uJDJa17rx9oJ7Ab15oAEulgwW4cUcu6nVwA1XlD+Ja4PIMkfyOMzOu3Dt8d3JMo278EeNGU9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:18:51.554701Z"},"content_sha256":"bed36034432edef82e897c3172d17bba875293e307497334f366d3e9184cf396","schema_version":"1.0","event_id":"sha256:bed36034432edef82e897c3172d17bba875293e307497334f366d3e9184cf396"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPXTXFQOFWOLSMGRXB3772FZUM/bundle.json","state_url":"https://pith.science/pith/MPXTXFQOFWOLSMGRXB3772FZUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPXTXFQOFWOLSMGRXB3772FZUM/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-05-31T12:18:51Z","links":{"resolver":"https://pith.science/pith/MPXTXFQOFWOLSMGRXB3772FZUM","bundle":"https://pith.science/pith/MPXTXFQOFWOLSMGRXB3772FZUM/bundle.json","state":"https://pith.science/pith/MPXTXFQOFWOLSMGRXB3772FZUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPXTXFQOFWOLSMGRXB3772FZUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MPXTXFQOFWOLSMGRXB3772FZUM","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":"eb6e86b44320a7928710091bbef6ee81125f3cd31892f2e48ef2299a4b85c7f3","cross_cats_sorted":["math.DS","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-05-24T04:53:07Z","title_canon_sha256":"d76b7609cfdc6e0d53084a0bc7159cb99520177ac619a2141872348b40da783f"},"schema_version":"1.0","source":{"id":"1805.09506","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09506","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09506v4","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09506","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"MPXTXFQOFWOL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MPXTXFQOFWOLSMGR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MPXTXFQO","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:bed36034432edef82e897c3172d17bba875293e307497334f366d3e9184cf396","target":"graph","created_at":"2026-05-18T00:12:43Z","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"},"paper":{"abstract_excerpt":"We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws ideas from a paper of Kr\\\"{o}n, it is written in a way that easily adapts to the setting of countable Borel equivalence relations, leading to a free decomposition result and a sufficient condition for treeability.","authors_text":"Anush Tserunyan","cross_cats":["math.DS","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-05-24T04:53:07Z","title":"A descriptive construction of trees and Stallings' theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09506","kind":"arxiv","version":4},"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:d4a5ce596c0b52905b9ada3e38e06cf4532b3fcc9b14a70fcdbb346a4467f7df","target":"record","created_at":"2026-05-18T00:12:43Z","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":"eb6e86b44320a7928710091bbef6ee81125f3cd31892f2e48ef2299a4b85c7f3","cross_cats_sorted":["math.DS","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-05-24T04:53:07Z","title_canon_sha256":"d76b7609cfdc6e0d53084a0bc7159cb99520177ac619a2141872348b40da783f"},"schema_version":"1.0","source":{"id":"1805.09506","kind":"arxiv","version":4}},"canonical_sha256":"63ef3b960e2d9cb930d1b877ffe8b9a33f417abd693d279baeacfeed52789151","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63ef3b960e2d9cb930d1b877ffe8b9a33f417abd693d279baeacfeed52789151","first_computed_at":"2026-05-18T00:12:43.034375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:43.034375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q1VyQGzSAWmf6J7jbz85bmGybBSXCJ8Vt3AUpa0xrsUvEfJbRC2vVu+QjZFGPWoiVv6hpN5RP7ZQSFRb2i8vDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:43.035091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09506","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4a5ce596c0b52905b9ada3e38e06cf4532b3fcc9b14a70fcdbb346a4467f7df","sha256:bed36034432edef82e897c3172d17bba875293e307497334f366d3e9184cf396"],"state_sha256":"a92fdc210a46465a2910279e08c8e8cc64a115f50f9b7ec326bc8737b9d035d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9pAyIY+C6cUFeQP7wxxkOXJPhDSGqAbwUjva0HMDsyKoItL7kMM7zozD5aYg5CtxNHlA9e3tscS0K9VsMiJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:18:51.558696Z","bundle_sha256":"8abde7e54399649c63fa13e8e0ac83cf1d3f1f90780b723d0d598dc2975ee00d"}}