{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:F3YMEZP6Q2EWO3LJOR2XZ5BDWF","short_pith_number":"pith:F3YMEZP6","schema_version":"1.0","canonical_sha256":"2ef0c265fe8689676d6974757cf423b17a768c91b7aed816fdff7c0fc9a9aafa","source":{"kind":"arxiv","id":"2501.00831","version":1},"attestation_state":"computed","paper":{"title":"Hazard-free Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Deepu Benson, Jayalal Sarma, Nalli Sai Soumya","submitted_at":"2025-01-01T13:25:37Z","abstract_excerpt":"Decision trees are one of the most fundamental computational models for computing Boolean functions $f : \\{0, 1\\}^n \\mapsto \\{0, 1\\}$. It is well-known that the depth and size of decision trees are closely related to time and number of processors respectively for computing functions in the CREW-PRAM model. For a given $f$, a fundamental goal is to minimize the depth and/or the size of the decision tree computing it.\n  In this paper, we extend the decision tree model to the world of hazard-free computation. We allow each query to produce three results: zero, one, or unknown. The output could al"},"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":"2501.00831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-01-01T13:25:37Z","cross_cats_sorted":[],"title_canon_sha256":"e6a19b8a8722d6916e9dc204804a8a9028dd93af5e4cc2103923ce28a99236b7","abstract_canon_sha256":"ac275588fe65732185c016a33d663754e639f022ff19b81b3172c7a72aaa2295"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:10.832866Z","signature_b64":"8EORDolhujCG6W92BMELywHn3qeOHKqajyQwCVjmIuJp3fMiq/YgAGK18jMnBIhZ+/ytR2MkISsDA+0WZmdBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ef0c265fe8689676d6974757cf423b17a768c91b7aed816fdff7c0fc9a9aafa","last_reissued_at":"2026-07-05T09:56:10.832375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:10.832375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hazard-free Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Deepu Benson, Jayalal Sarma, Nalli Sai Soumya","submitted_at":"2025-01-01T13:25:37Z","abstract_excerpt":"Decision trees are one of the most fundamental computational models for computing Boolean functions $f : \\{0, 1\\}^n \\mapsto \\{0, 1\\}$. It is well-known that the depth and size of decision trees are closely related to time and number of processors respectively for computing functions in the CREW-PRAM model. For a given $f$, a fundamental goal is to minimize the depth and/or the size of the decision tree computing it.\n  In this paper, we extend the decision tree model to the world of hazard-free computation. We allow each query to produce three results: zero, one, or unknown. The output could al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00831","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.00831/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":"2501.00831","created_at":"2026-07-05T09:56:10.832433+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.00831v1","created_at":"2026-07-05T09:56:10.832433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00831","created_at":"2026-07-05T09:56:10.832433+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3YMEZP6Q2EW","created_at":"2026-07-05T09:56:10.832433+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3YMEZP6Q2EWO3LJ","created_at":"2026-07-05T09:56:10.832433+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3YMEZP6","created_at":"2026-07-05T09:56:10.832433+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/F3YMEZP6Q2EWO3LJOR2XZ5BDWF","json":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF.json","graph_json":"https://pith.science/api/pith-number/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/graph.json","events_json":"https://pith.science/api/pith-number/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/events.json","paper":"https://pith.science/paper/F3YMEZP6"},"agent_actions":{"view_html":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF","download_json":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF.json","view_paper":"https://pith.science/paper/F3YMEZP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.00831&json=true","fetch_graph":"https://pith.science/api/pith-number/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/graph.json","fetch_events":"https://pith.science/api/pith-number/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/action/storage_attestation","attest_author":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/action/author_attestation","sign_citation":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/action/citation_signature","submit_replication":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/action/replication_record"}},"created_at":"2026-07-05T09:56:10.832433+00:00","updated_at":"2026-07-05T09:56:10.832433+00:00"}