{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3EXIHP4FISU2KVHLVLZSXSIUAJ","short_pith_number":"pith:3EXIHP4F","schema_version":"1.0","canonical_sha256":"d92e83bf8544a9a554ebaaf32bc9140261b322c6629f698fc21734b745d6b84c","source":{"kind":"arxiv","id":"1301.6327","version":2},"attestation_state":"computed","paper":{"title":"Ordered Partitions and Drawings of Rooted Plane Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qingchun Ren","submitted_at":"2013-01-27T07:27:06Z","abstract_excerpt":"We study the bounded regions in a generic slice of the hyperplane arrangement in $\\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial objects, including the ordered partitions of $[n]$ all of whose left-to-right minima occur at odd locations and the drawings of rooted plane trees with $n+1$ vertices. These are sequences of rooted plane trees such that each tree in a sequence can be obtained from the next one by removing a leaf."},"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":"1301.6327","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-27T07:27:06Z","cross_cats_sorted":[],"title_canon_sha256":"2b8c97c9656fc5f37b3dc814a1f3572cf3a2f2f590571ff1ada2646c4b13912c","abstract_canon_sha256":"de0dc8618a5df6367430e1f3908a4e9c8760c7035f239b964ca5f1b2745eb3bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:59.024743Z","signature_b64":"UrLiR7S9pbh8rbZUB+i6j6Y5IWbUFpvifLaY/LSBSeqtnDHQYyqxyOznsxVdwCTt/UC/6ayefxgUoAae3K/eAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d92e83bf8544a9a554ebaaf32bc9140261b322c6629f698fc21734b745d6b84c","last_reissued_at":"2026-05-18T03:00:59.024050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:59.024050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered Partitions and Drawings of Rooted Plane Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Qingchun Ren","submitted_at":"2013-01-27T07:27:06Z","abstract_excerpt":"We study the bounded regions in a generic slice of the hyperplane arrangement in $\\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial objects, including the ordered partitions of $[n]$ all of whose left-to-right minima occur at odd locations and the drawings of rooted plane trees with $n+1$ vertices. These are sequences of rooted plane trees such that each tree in a sequence can be obtained from the next one by removing a leaf."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6327","kind":"arxiv","version":2},"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":"1301.6327","created_at":"2026-05-18T03:00:59.024158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6327v2","created_at":"2026-05-18T03:00:59.024158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6327","created_at":"2026-05-18T03:00:59.024158+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EXIHP4FISU2","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EXIHP4FISU2KVHL","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EXIHP4F","created_at":"2026-05-18T12:27:32.513160+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/3EXIHP4FISU2KVHLVLZSXSIUAJ","json":"https://pith.science/pith/3EXIHP4FISU2KVHLVLZSXSIUAJ.json","graph_json":"https://pith.science/api/pith-number/3EXIHP4FISU2KVHLVLZSXSIUAJ/graph.json","events_json":"https://pith.science/api/pith-number/3EXIHP4FISU2KVHLVLZSXSIUAJ/events.json","paper":"https://pith.science/paper/3EXIHP4F"},"agent_actions":{"view_html":"https://pith.science/pith/3EXIHP4FISU2KVHLVLZSXSIUAJ","download_json":"https://pith.science/pith/3EXIHP4FISU2KVHLVLZSXSIUAJ.json","view_paper":"https://pith.science/paper/3EXIHP4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6327&json=true","fetch_graph":"https://pith.science/api/pith-number/3EXIHP4FISU2KVHLVLZSXSIUAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3EXIHP4FISU2KVHLVLZSXSIUAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EXIHP4FISU2KVHLVLZSXSIUAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EXIHP4FISU2KVHLVLZSXSIUAJ/action/storage_attestation","attest_author":"https://pith.science/pith/3EXIHP4FISU2KVHLVLZSXSIUAJ/action/author_attestation","sign_citation":"https://pith.science/pith/3EXIHP4FISU2KVHLVLZSXSIUAJ/action/citation_signature","submit_replication":"https://pith.science/pith/3EXIHP4FISU2KVHLVLZSXSIUAJ/action/replication_record"}},"created_at":"2026-05-18T03:00:59.024158+00:00","updated_at":"2026-05-18T03:00:59.024158+00:00"}