{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:H3GLGW7DLRWNT3UGECQHWGEXKO","short_pith_number":"pith:H3GLGW7D","schema_version":"1.0","canonical_sha256":"3eccb35be35c6cd9ee8620a07b18975397c29c6338d731e92c9d80f2d604819f","source":{"kind":"arxiv","id":"1411.7834","version":1},"attestation_state":"computed","paper":{"title":"Linial arrangements and local binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Forge","submitted_at":"2014-11-28T12:15:01Z","abstract_excerpt":"We study the set of NBC sets (no broken circuit sets) of the Linial arrangement and deduce a constructive bijection to the set of local binary search trees. We then generalize this construction to two families of Linial type arrangements for which the bijections are with some $k$-ary labelled trees that we introduce for this purpose."},"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":"1411.7834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-28T12:15:01Z","cross_cats_sorted":[],"title_canon_sha256":"35a1eaed3266595a6968b2bbff5db77a441a01a7ae9a42558ab7238f3f522d9a","abstract_canon_sha256":"5f413a5a7767e26b317d717584715f6fa2d17103a1c4f4e733ae8fd39497473f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:37.143504Z","signature_b64":"5ExX208++xkqXIJNW3XX97uv0Wnc2DUHUxMXAmjUEA/iIj44WDNAIcuyPjZInyvMQJIYSWrw83Y850BqvHLxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eccb35be35c6cd9ee8620a07b18975397c29c6338d731e92c9d80f2d604819f","last_reissued_at":"2026-05-18T02:32:37.143126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:37.143126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linial arrangements and local binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Forge","submitted_at":"2014-11-28T12:15:01Z","abstract_excerpt":"We study the set of NBC sets (no broken circuit sets) of the Linial arrangement and deduce a constructive bijection to the set of local binary search trees. We then generalize this construction to two families of Linial type arrangements for which the bijections are with some $k$-ary labelled trees that we introduce for this purpose."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7834","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":"1411.7834","created_at":"2026-05-18T02:32:37.143190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7834v1","created_at":"2026-05-18T02:32:37.143190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7834","created_at":"2026-05-18T02:32:37.143190+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3GLGW7DLRWN","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3GLGW7DLRWNT3UG","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3GLGW7D","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/H3GLGW7DLRWNT3UGECQHWGEXKO","json":"https://pith.science/pith/H3GLGW7DLRWNT3UGECQHWGEXKO.json","graph_json":"https://pith.science/api/pith-number/H3GLGW7DLRWNT3UGECQHWGEXKO/graph.json","events_json":"https://pith.science/api/pith-number/H3GLGW7DLRWNT3UGECQHWGEXKO/events.json","paper":"https://pith.science/paper/H3GLGW7D"},"agent_actions":{"view_html":"https://pith.science/pith/H3GLGW7DLRWNT3UGECQHWGEXKO","download_json":"https://pith.science/pith/H3GLGW7DLRWNT3UGECQHWGEXKO.json","view_paper":"https://pith.science/paper/H3GLGW7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7834&json=true","fetch_graph":"https://pith.science/api/pith-number/H3GLGW7DLRWNT3UGECQHWGEXKO/graph.json","fetch_events":"https://pith.science/api/pith-number/H3GLGW7DLRWNT3UGECQHWGEXKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3GLGW7DLRWNT3UGECQHWGEXKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3GLGW7DLRWNT3UGECQHWGEXKO/action/storage_attestation","attest_author":"https://pith.science/pith/H3GLGW7DLRWNT3UGECQHWGEXKO/action/author_attestation","sign_citation":"https://pith.science/pith/H3GLGW7DLRWNT3UGECQHWGEXKO/action/citation_signature","submit_replication":"https://pith.science/pith/H3GLGW7DLRWNT3UGECQHWGEXKO/action/replication_record"}},"created_at":"2026-05-18T02:32:37.143190+00:00","updated_at":"2026-05-18T02:32:37.143190+00:00"}