{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ITQJ7ZH35KP4Z76H35PTXVEIZD","short_pith_number":"pith:ITQJ7ZH3","schema_version":"1.0","canonical_sha256":"44e09fe4fbea9fccffc7df5f3bd488c8e3c3857fc99f31723f3428dd91f2bd7f","source":{"kind":"arxiv","id":"2512.19060","version":2},"attestation_state":"computed","paper":{"title":"On the complexity of computing Strahler numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Markus Lohrey, Moses Ganardi","submitted_at":"2025-12-22T05:56:44Z","abstract_excerpt":"It is shown that the problem of computing the Strahler number of a binary tree given as a term is complete for the circuit complexity class uniform $\\mathsf{NC}^1$. For several variants, where the binary tree is given by a pointer structure or in a succinct form by a directed acyclic graph or a tree straight-line program, the complexity of computing the Strahler number is determined as well. We show that the problem of deciding whether a given context-free grammar in Chomsky normal form produces a derivation tree with a Strahler number of at least $k$ is $\\mathsf{P}$-complete. If the derivatio"},"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":"2512.19060","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-12-22T05:56:44Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"64f333f3bf6a971e6aac91df898df24435901712444dba0ffe22ff4c8a0f935c","abstract_canon_sha256":"2cedc5014f9845a3b970fed8fadc7fdf8ddf4ae2188c9693d425d3645895e953"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T00:13:44.697131Z","signature_b64":"Xebdz1uceiQSZ/ejmvePTKyWFXU3mKKbl0o3uXAqLCwNCXz7zd5K8fAyY0+Fd0jqp8b6y7xYOygskJRhgXjBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44e09fe4fbea9fccffc7df5f3bd488c8e3c3857fc99f31723f3428dd91f2bd7f","last_reissued_at":"2026-06-05T00:13:44.696490Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T00:13:44.696490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of computing Strahler numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Markus Lohrey, Moses Ganardi","submitted_at":"2025-12-22T05:56:44Z","abstract_excerpt":"It is shown that the problem of computing the Strahler number of a binary tree given as a term is complete for the circuit complexity class uniform $\\mathsf{NC}^1$. For several variants, where the binary tree is given by a pointer structure or in a succinct form by a directed acyclic graph or a tree straight-line program, the complexity of computing the Strahler number is determined as well. We show that the problem of deciding whether a given context-free grammar in Chomsky normal form produces a derivation tree with a Strahler number of at least $k$ is $\\mathsf{P}$-complete. If the derivatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.19060","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.19060/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2512.19060","created_at":"2026-06-05T00:13:44.696585+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.19060v2","created_at":"2026-06-05T00:13:44.696585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.19060","created_at":"2026-06-05T00:13:44.696585+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITQJ7ZH35KP4","created_at":"2026-06-05T00:13:44.696585+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITQJ7ZH35KP4Z76H","created_at":"2026-06-05T00:13:44.696585+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITQJ7ZH3","created_at":"2026-06-05T00:13:44.696585+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/ITQJ7ZH35KP4Z76H35PTXVEIZD","json":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD.json","graph_json":"https://pith.science/api/pith-number/ITQJ7ZH35KP4Z76H35PTXVEIZD/graph.json","events_json":"https://pith.science/api/pith-number/ITQJ7ZH35KP4Z76H35PTXVEIZD/events.json","paper":"https://pith.science/paper/ITQJ7ZH3"},"agent_actions":{"view_html":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD","download_json":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD.json","view_paper":"https://pith.science/paper/ITQJ7ZH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.19060&json=true","fetch_graph":"https://pith.science/api/pith-number/ITQJ7ZH35KP4Z76H35PTXVEIZD/graph.json","fetch_events":"https://pith.science/api/pith-number/ITQJ7ZH35KP4Z76H35PTXVEIZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/action/storage_attestation","attest_author":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/action/author_attestation","sign_citation":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/action/citation_signature","submit_replication":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/action/replication_record"}},"created_at":"2026-06-05T00:13:44.696585+00:00","updated_at":"2026-06-05T00:13:44.696585+00:00"}