{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:F3YMEZP6Q2EWO3LJOR2XZ5BDWF","short_pith_number":"pith:F3YMEZP6","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"},"canonical_sha256":"2ef0c265fe8689676d6974757cf423b17a768c91b7aed816fdff7c0fc9a9aafa","source":{"kind":"arxiv","id":"2501.00831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.00831","created_at":"2026-07-05T09:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"2501.00831v1","created_at":"2026-07-05T09:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00831","created_at":"2026-07-05T09:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"F3YMEZP6Q2EW","created_at":"2026-07-05T09:56:10Z"},{"alias_kind":"pith_short_16","alias_value":"F3YMEZP6Q2EWO3LJ","created_at":"2026-07-05T09:56:10Z"},{"alias_kind":"pith_short_8","alias_value":"F3YMEZP6","created_at":"2026-07-05T09:56:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:F3YMEZP6Q2EWO3LJOR2XZ5BDWF","target":"record","payload":{"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"},"canonical_sha256":"2ef0c265fe8689676d6974757cf423b17a768c91b7aed816fdff7c0fc9a9aafa","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"},"source_kind":"arxiv","source_id":"2501.00831","source_version":1,"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-07-05T09:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIHJiW6zG6c71hxTXI9wFUN0/ageuJbhuq17kbZPso6wTzaDsumRNxq2RrTauoxCP3EJ74cSWG5999YKcA5GBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:01:59.023085Z"},"content_sha256":"5b68f8a1383f48f98bf9554bed54e8106c53e75543a3902cade531cdaa8d4c7c","schema_version":"1.0","event_id":"sha256:5b68f8a1383f48f98bf9554bed54e8106c53e75543a3902cade531cdaa8d4c7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:F3YMEZP6Q2EWO3LJOR2XZ5BDWF","target":"graph","payload":{"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"},"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-07-05T09:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4c7R479XCZWSmT5EccDn5uxq9o7Dmos5ayfvDh1mMAs+u53AcxJwdX6lXfbkStE3sCLUdxeGi5YSyHxljhSgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:01:59.023817Z"},"content_sha256":"939ff38064085875871e8041449d4dccb81f9bcee88796fe8664c0cdc1321312","schema_version":"1.0","event_id":"sha256:939ff38064085875871e8041449d4dccb81f9bcee88796fe8664c0cdc1321312"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/bundle.json","state_url":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/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-04T17:01:59Z","links":{"resolver":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF","bundle":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/bundle.json","state":"https://pith.science/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3YMEZP6Q2EWO3LJOR2XZ5BDWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:F3YMEZP6Q2EWO3LJOR2XZ5BDWF","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":"ac275588fe65732185c016a33d663754e639f022ff19b81b3172c7a72aaa2295","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-01-01T13:25:37Z","title_canon_sha256":"e6a19b8a8722d6916e9dc204804a8a9028dd93af5e4cc2103923ce28a99236b7"},"schema_version":"1.0","source":{"id":"2501.00831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.00831","created_at":"2026-07-05T09:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"2501.00831v1","created_at":"2026-07-05T09:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00831","created_at":"2026-07-05T09:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"F3YMEZP6Q2EW","created_at":"2026-07-05T09:56:10Z"},{"alias_kind":"pith_short_16","alias_value":"F3YMEZP6Q2EWO3LJ","created_at":"2026-07-05T09:56:10Z"},{"alias_kind":"pith_short_8","alias_value":"F3YMEZP6","created_at":"2026-07-05T09:56:10Z"}],"graph_snapshots":[{"event_id":"sha256:939ff38064085875871e8041449d4dccb81f9bcee88796fe8664c0cdc1321312","target":"graph","created_at":"2026-07-05T09:56:10Z","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/2501.00831/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Balagopal Komarath, Deepu Benson, Jayalal Sarma, Nalli Sai Soumya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-01-01T13:25:37Z","title":"Hazard-free Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00831","kind":"arxiv","version":1},"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:5b68f8a1383f48f98bf9554bed54e8106c53e75543a3902cade531cdaa8d4c7c","target":"record","created_at":"2026-07-05T09:56:10Z","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":"ac275588fe65732185c016a33d663754e639f022ff19b81b3172c7a72aaa2295","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-01-01T13:25:37Z","title_canon_sha256":"e6a19b8a8722d6916e9dc204804a8a9028dd93af5e4cc2103923ce28a99236b7"},"schema_version":"1.0","source":{"id":"2501.00831","kind":"arxiv","version":1}},"canonical_sha256":"2ef0c265fe8689676d6974757cf423b17a768c91b7aed816fdff7c0fc9a9aafa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ef0c265fe8689676d6974757cf423b17a768c91b7aed816fdff7c0fc9a9aafa","first_computed_at":"2026-07-05T09:56:10.832375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:56:10.832375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8EORDolhujCG6W92BMELywHn3qeOHKqajyQwCVjmIuJp3fMiq/YgAGK18jMnBIhZ+/ytR2MkISsDA+0WZmdBBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:56:10.832866Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.00831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b68f8a1383f48f98bf9554bed54e8106c53e75543a3902cade531cdaa8d4c7c","sha256:939ff38064085875871e8041449d4dccb81f9bcee88796fe8664c0cdc1321312"],"state_sha256":"925133e1e0d37bd14b03d6b9761f713416472f6f64698da741c163c6b27aa439"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/k7cbPE106WFWTwadzcPThi99wongMvyGpCu2K/Y3suC9ARBI9E62EOu0+2ZDatEYON8VzqbMqh/kfpaW8XBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:01:59.030957Z","bundle_sha256":"0b799c76be593ee12aedf62a4439734dc854c48c084bb710b40a1ce0bec1c20f"}}