{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZFDMDFOLE6CCK2TDVENJELUOHM","short_pith_number":"pith:ZFDMDFOL","canonical_record":{"source":{"id":"2305.13539","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-05-22T23:23:05Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"40368f00da10ecb26e8aa09e2ef871a865f7055d7fed2c6df0ddce8b84f6a173","abstract_canon_sha256":"387bec57b5ffdb290074d46ef092147219f35d1d8461856c2e939744d808bf3b"},"schema_version":"1.0"},"canonical_sha256":"c946c195cb2784256a63a91a922e8e3b1697b864704fc9d06f1ee15b3e7bcfff","source":{"kind":"arxiv","id":"2305.13539","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.13539","created_at":"2026-07-05T06:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"2305.13539v2","created_at":"2026-07-05T06:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13539","created_at":"2026-07-05T06:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZFDMDFOLE6CC","created_at":"2026-07-05T06:13:56Z"},{"alias_kind":"pith_short_16","alias_value":"ZFDMDFOLE6CCK2TD","created_at":"2026-07-05T06:13:56Z"},{"alias_kind":"pith_short_8","alias_value":"ZFDMDFOL","created_at":"2026-07-05T06:13:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZFDMDFOLE6CCK2TDVENJELUOHM","target":"record","payload":{"canonical_record":{"source":{"id":"2305.13539","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-05-22T23:23:05Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"40368f00da10ecb26e8aa09e2ef871a865f7055d7fed2c6df0ddce8b84f6a173","abstract_canon_sha256":"387bec57b5ffdb290074d46ef092147219f35d1d8461856c2e939744d808bf3b"},"schema_version":"1.0"},"canonical_sha256":"c946c195cb2784256a63a91a922e8e3b1697b864704fc9d06f1ee15b3e7bcfff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:56.832532Z","signature_b64":"0t13V8HgA+gxgUADo2ZVsgZnWXL1AikmVI83fVAyGhyXNPxYZEReKz9hpV58Hy3UMKsg5Gj6mmhTFysL0DhwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c946c195cb2784256a63a91a922e8e3b1697b864704fc9d06f1ee15b3e7bcfff","last_reissued_at":"2026-07-05T06:13:56.832094Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:56.832094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.13539","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-07-05T06:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pO52oljtCWilaqxavJkIdtEX3W3ATp6QzlrZKGhcO5SizNvgrz+hlmEwya9wjYcsE+3kR4wrRhvK21lb/OhNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:30:26.083831Z"},"content_sha256":"8358d1dad4569b5b9a144d1a617de9a7fb4dbec928511145aa44b7405dee8048","schema_version":"1.0","event_id":"sha256:8358d1dad4569b5b9a144d1a617de9a7fb4dbec928511145aa44b7405dee8048"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZFDMDFOLE6CCK2TDVENJELUOHM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Empirical Challenge for NC Theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DC","authors_text":"Ananth Hari, Uzi Vishkin","submitted_at":"2023-05-22T23:23:05Z","abstract_excerpt":"Horn-satisfiability or Horn-SAT is the problem of deciding whether a satisfying assignment exists for a Horn formula, a conjunction of clauses each with at most one positive literal (also known as Horn clauses). It is a well-known P-complete problem, which implies that unless P = NC, it is a hard problem to parallelize. In this paper, we empirically show that, under a known simple random model for generating the Horn formula, the ratio of hard-to-parallelize instances (closer to the worst-case behavior) is infinitesimally small. We show that the depth of a parallel algorithm for Horn-SAT is po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.13539","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/2305.13539/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-05T06:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6EVLVmEZtm9uYJZu91necf0CDf77H7nSmbngsQqILfIupUCMJvIjcYB12vXPUyLrhRaOXDn2RzM09gbCiSbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:30:26.084200Z"},"content_sha256":"69615535826d47bfa5ab733756aa1566270b59ebac0d79113fe6ab47576b0dfe","schema_version":"1.0","event_id":"sha256:69615535826d47bfa5ab733756aa1566270b59ebac0d79113fe6ab47576b0dfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/bundle.json","state_url":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/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-07-07T08:30:26Z","links":{"resolver":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM","bundle":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/bundle.json","state":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZFDMDFOLE6CCK2TDVENJELUOHM","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":"387bec57b5ffdb290074d46ef092147219f35d1d8461856c2e939744d808bf3b","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-05-22T23:23:05Z","title_canon_sha256":"40368f00da10ecb26e8aa09e2ef871a865f7055d7fed2c6df0ddce8b84f6a173"},"schema_version":"1.0","source":{"id":"2305.13539","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.13539","created_at":"2026-07-05T06:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"2305.13539v2","created_at":"2026-07-05T06:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13539","created_at":"2026-07-05T06:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZFDMDFOLE6CC","created_at":"2026-07-05T06:13:56Z"},{"alias_kind":"pith_short_16","alias_value":"ZFDMDFOLE6CCK2TD","created_at":"2026-07-05T06:13:56Z"},{"alias_kind":"pith_short_8","alias_value":"ZFDMDFOL","created_at":"2026-07-05T06:13:56Z"}],"graph_snapshots":[{"event_id":"sha256:69615535826d47bfa5ab733756aa1566270b59ebac0d79113fe6ab47576b0dfe","target":"graph","created_at":"2026-07-05T06:13:56Z","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/2305.13539/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Horn-satisfiability or Horn-SAT is the problem of deciding whether a satisfying assignment exists for a Horn formula, a conjunction of clauses each with at most one positive literal (also known as Horn clauses). It is a well-known P-complete problem, which implies that unless P = NC, it is a hard problem to parallelize. In this paper, we empirically show that, under a known simple random model for generating the Horn formula, the ratio of hard-to-parallelize instances (closer to the worst-case behavior) is infinitesimally small. We show that the depth of a parallel algorithm for Horn-SAT is po","authors_text":"Ananth Hari, Uzi Vishkin","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-05-22T23:23:05Z","title":"Empirical Challenge for NC Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.13539","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:8358d1dad4569b5b9a144d1a617de9a7fb4dbec928511145aa44b7405dee8048","target":"record","created_at":"2026-07-05T06:13:56Z","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":"387bec57b5ffdb290074d46ef092147219f35d1d8461856c2e939744d808bf3b","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-05-22T23:23:05Z","title_canon_sha256":"40368f00da10ecb26e8aa09e2ef871a865f7055d7fed2c6df0ddce8b84f6a173"},"schema_version":"1.0","source":{"id":"2305.13539","kind":"arxiv","version":2}},"canonical_sha256":"c946c195cb2784256a63a91a922e8e3b1697b864704fc9d06f1ee15b3e7bcfff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c946c195cb2784256a63a91a922e8e3b1697b864704fc9d06f1ee15b3e7bcfff","first_computed_at":"2026-07-05T06:13:56.832094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:13:56.832094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0t13V8HgA+gxgUADo2ZVsgZnWXL1AikmVI83fVAyGhyXNPxYZEReKz9hpV58Hy3UMKsg5Gj6mmhTFysL0DhwCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:13:56.832532Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.13539","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8358d1dad4569b5b9a144d1a617de9a7fb4dbec928511145aa44b7405dee8048","sha256:69615535826d47bfa5ab733756aa1566270b59ebac0d79113fe6ab47576b0dfe"],"state_sha256":"4b38d669a81e06683a0acf3ac957b9d1a1ebfdedf674ea153dcb498eeed4d817"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hp1I00HYbdh5bl1HobDz7rXnBucDvBwUUmfYajz9Sxfmqelg92DR99VnFoThI7cPxAvha+GF749CHud7IRFeBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:30:26.086181Z","bundle_sha256":"6978bd861f0cbac1510fc1ce7090b57c073fbde05f1b5966ea77fc8138225e30"}}