{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GNQPXWTLJRAC5JNCALN6JWDOXB","short_pith_number":"pith:GNQPXWTL","schema_version":"1.0","canonical_sha256":"3360fbda6b4c402ea5a202dbe4d86eb84f44da4e364ab4ba99f51b557aed2257","source":{"kind":"arxiv","id":"1404.4829","version":1},"attestation_state":"computed","paper":{"title":"Trimming a Tree and the Two-Sided Skorohod Reflection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Emmanuel Schertzer","submitted_at":"2014-04-18T16:02:19Z","abstract_excerpt":"The $h$-trimming of a tree is a natural regularization procedure which consists in pruning the small branches of a tree: given $h\\geq0$, it is obtained by only keeping the vertices having at least one leaf above them at a distance greater or equal to $h$.\n  The $h$-cut of a function $f$ is the function of minimal total variation uniformly approximating the increments of $f$ with accuracy $h$, and can be explicitly constructed via the two-sided Skorohod reflection of $f$ on the interval $[0,h]$.\n  In this work, we show that the contour path of the $h$-trimming of a rooted real tree is given by "},"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":"1404.4829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-18T16:02:19Z","cross_cats_sorted":[],"title_canon_sha256":"0a80bc520da0d7ca764d628e4f16a7f1966084ed14ff1530b8f81efd32977d2a","abstract_canon_sha256":"2afd1107b3f2720a8f3a0e0e5f1be8dd8162aee9ffa8972b37151f9d18ef0835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:54.786361Z","signature_b64":"i/LJx5ilZAPexgOp8jT7lyy5Z/9kBbrqYGpGnKNVW7KDepv35TF3VZrnnzSCCrPyYeP/Vety9HhBnHsrGwrCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3360fbda6b4c402ea5a202dbe4d86eb84f44da4e364ab4ba99f51b557aed2257","last_reissued_at":"2026-05-18T02:53:54.785573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:54.785573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trimming a Tree and the Two-Sided Skorohod Reflection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Emmanuel Schertzer","submitted_at":"2014-04-18T16:02:19Z","abstract_excerpt":"The $h$-trimming of a tree is a natural regularization procedure which consists in pruning the small branches of a tree: given $h\\geq0$, it is obtained by only keeping the vertices having at least one leaf above them at a distance greater or equal to $h$.\n  The $h$-cut of a function $f$ is the function of minimal total variation uniformly approximating the increments of $f$ with accuracy $h$, and can be explicitly constructed via the two-sided Skorohod reflection of $f$ on the interval $[0,h]$.\n  In this work, we show that the contour path of the $h$-trimming of a rooted real tree is given by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4829","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":""},"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":"1404.4829","created_at":"2026-05-18T02:53:54.785705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4829v1","created_at":"2026-05-18T02:53:54.785705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4829","created_at":"2026-05-18T02:53:54.785705+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNQPXWTLJRAC","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNQPXWTLJRAC5JNC","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNQPXWTL","created_at":"2026-05-18T12:28:30.664211+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/GNQPXWTLJRAC5JNCALN6JWDOXB","json":"https://pith.science/pith/GNQPXWTLJRAC5JNCALN6JWDOXB.json","graph_json":"https://pith.science/api/pith-number/GNQPXWTLJRAC5JNCALN6JWDOXB/graph.json","events_json":"https://pith.science/api/pith-number/GNQPXWTLJRAC5JNCALN6JWDOXB/events.json","paper":"https://pith.science/paper/GNQPXWTL"},"agent_actions":{"view_html":"https://pith.science/pith/GNQPXWTLJRAC5JNCALN6JWDOXB","download_json":"https://pith.science/pith/GNQPXWTLJRAC5JNCALN6JWDOXB.json","view_paper":"https://pith.science/paper/GNQPXWTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4829&json=true","fetch_graph":"https://pith.science/api/pith-number/GNQPXWTLJRAC5JNCALN6JWDOXB/graph.json","fetch_events":"https://pith.science/api/pith-number/GNQPXWTLJRAC5JNCALN6JWDOXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNQPXWTLJRAC5JNCALN6JWDOXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNQPXWTLJRAC5JNCALN6JWDOXB/action/storage_attestation","attest_author":"https://pith.science/pith/GNQPXWTLJRAC5JNCALN6JWDOXB/action/author_attestation","sign_citation":"https://pith.science/pith/GNQPXWTLJRAC5JNCALN6JWDOXB/action/citation_signature","submit_replication":"https://pith.science/pith/GNQPXWTLJRAC5JNCALN6JWDOXB/action/replication_record"}},"created_at":"2026-05-18T02:53:54.785705+00:00","updated_at":"2026-05-18T02:53:54.785705+00:00"}