{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ITQJ7ZH35KP4Z76H35PTXVEIZD","short_pith_number":"pith:ITQJ7ZH3","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"},"canonical_sha256":"44e09fe4fbea9fccffc7df5f3bd488c8e3c3857fc99f31723f3428dd91f2bd7f","source":{"kind":"arxiv","id":"2512.19060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.19060","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"arxiv_version","alias_value":"2512.19060v2","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.19060","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"pith_short_12","alias_value":"ITQJ7ZH35KP4","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"pith_short_16","alias_value":"ITQJ7ZH35KP4Z76H","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"pith_short_8","alias_value":"ITQJ7ZH3","created_at":"2026-06-05T00:13:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ITQJ7ZH35KP4Z76H35PTXVEIZD","target":"record","payload":{"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"},"canonical_sha256":"44e09fe4fbea9fccffc7df5f3bd488c8e3c3857fc99f31723f3428dd91f2bd7f","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"},"source_kind":"arxiv","source_id":"2512.19060","source_version":2,"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-06-05T00:13:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m54usRMeLgABWammgdH5UKTHT7lT7yxFThk6L2PBUAiYDU8hYM9xQBW/DMM/eakINLXFPmL9k6fL+YULREF0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T05:26:43.472392Z"},"content_sha256":"18376bb08632ed0a3cdf0a7d12fd9f97dc5561ccbfe3676eff630e8f2f49396f","schema_version":"1.0","event_id":"sha256:18376bb08632ed0a3cdf0a7d12fd9f97dc5561ccbfe3676eff630e8f2f49396f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ITQJ7ZH35KP4Z76H35PTXVEIZD","target":"graph","payload":{"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"},"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-06-05T00:13:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQ2mlW2VyMR5/yfWJdBbeKG1hPcfrCYZ/zIn6h4CvfquFscuxboHffOpK5jlox/qNTzweMj1v7vYYxGDGLmwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T05:26:43.472980Z"},"content_sha256":"3ec746c8c5874121fe8452c9b81e24281de32e87e0039650e268158aa083d3f5","schema_version":"1.0","event_id":"sha256:3ec746c8c5874121fe8452c9b81e24281de32e87e0039650e268158aa083d3f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/bundle.json","state_url":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/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-08-12T05:26:43Z","links":{"resolver":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD","bundle":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/bundle.json","state":"https://pith.science/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITQJ7ZH35KP4Z76H35PTXVEIZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ITQJ7ZH35KP4Z76H35PTXVEIZD","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":"2cedc5014f9845a3b970fed8fadc7fdf8ddf4ae2188c9693d425d3645895e953","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-12-22T05:56:44Z","title_canon_sha256":"64f333f3bf6a971e6aac91df898df24435901712444dba0ffe22ff4c8a0f935c"},"schema_version":"1.0","source":{"id":"2512.19060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.19060","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"arxiv_version","alias_value":"2512.19060v2","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.19060","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"pith_short_12","alias_value":"ITQJ7ZH35KP4","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"pith_short_16","alias_value":"ITQJ7ZH35KP4Z76H","created_at":"2026-06-05T00:13:44Z"},{"alias_kind":"pith_short_8","alias_value":"ITQJ7ZH3","created_at":"2026-06-05T00:13:44Z"}],"graph_snapshots":[{"event_id":"sha256:3ec746c8c5874121fe8452c9b81e24281de32e87e0039650e268158aa083d3f5","target":"graph","created_at":"2026-06-05T00:13:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2512.19060/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Markus Lohrey, Moses Ganardi","cross_cats":["cs.FL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-12-22T05:56:44Z","title":"On the complexity of computing Strahler numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.19060","kind":"arxiv","version":2},"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:18376bb08632ed0a3cdf0a7d12fd9f97dc5561ccbfe3676eff630e8f2f49396f","target":"record","created_at":"2026-06-05T00:13:44Z","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":"2cedc5014f9845a3b970fed8fadc7fdf8ddf4ae2188c9693d425d3645895e953","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-12-22T05:56:44Z","title_canon_sha256":"64f333f3bf6a971e6aac91df898df24435901712444dba0ffe22ff4c8a0f935c"},"schema_version":"1.0","source":{"id":"2512.19060","kind":"arxiv","version":2}},"canonical_sha256":"44e09fe4fbea9fccffc7df5f3bd488c8e3c3857fc99f31723f3428dd91f2bd7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44e09fe4fbea9fccffc7df5f3bd488c8e3c3857fc99f31723f3428dd91f2bd7f","first_computed_at":"2026-06-05T00:13:44.696490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T00:13:44.696490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xebdz1uceiQSZ/ejmvePTKyWFXU3mKKbl0o3uXAqLCwNCXz7zd5K8fAyY0+Fd0jqp8b6y7xYOygskJRhgXjBCg==","signature_status":"signed_v1","signed_at":"2026-06-05T00:13:44.697131Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.19060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18376bb08632ed0a3cdf0a7d12fd9f97dc5561ccbfe3676eff630e8f2f49396f","sha256:3ec746c8c5874121fe8452c9b81e24281de32e87e0039650e268158aa083d3f5"],"state_sha256":"208d7389b67adc45285d78594c095c863a7f026b7e53fbe3bd723cce05662ad5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9gcV5h/hPOT1im4JaBQf/oCMj+LVh4Qcr9Vqo0L8Z41nvXZ3XDPsfdzQonwf1vipzLEmNVA6DXcgOXKE0bKDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T05:26:43.478540Z","bundle_sha256":"b2e245e0bc5c431ef8fc4d6247b3646966888f78f1dca5cc543a77fc84c920f8"}}