{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZFDMDFOLE6CCK2TDVENJELUOHM","short_pith_number":"pith:ZFDMDFOL","schema_version":"1.0","canonical_sha256":"c946c195cb2784256a63a91a922e8e3b1697b864704fc9d06f1ee15b3e7bcfff","source":{"kind":"arxiv","id":"2305.13539","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.13539","created_at":"2026-07-05T06:13:56.832156+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.13539v2","created_at":"2026-07-05T06:13:56.832156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.13539","created_at":"2026-07-05T06:13:56.832156+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFDMDFOLE6CC","created_at":"2026-07-05T06:13:56.832156+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFDMDFOLE6CCK2TD","created_at":"2026-07-05T06:13:56.832156+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFDMDFOL","created_at":"2026-07-05T06:13:56.832156+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/ZFDMDFOLE6CCK2TDVENJELUOHM","json":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM.json","graph_json":"https://pith.science/api/pith-number/ZFDMDFOLE6CCK2TDVENJELUOHM/graph.json","events_json":"https://pith.science/api/pith-number/ZFDMDFOLE6CCK2TDVENJELUOHM/events.json","paper":"https://pith.science/paper/ZFDMDFOL"},"agent_actions":{"view_html":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM","download_json":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM.json","view_paper":"https://pith.science/paper/ZFDMDFOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.13539&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFDMDFOLE6CCK2TDVENJELUOHM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFDMDFOLE6CCK2TDVENJELUOHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/action/storage_attestation","attest_author":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/action/author_attestation","sign_citation":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/action/citation_signature","submit_replication":"https://pith.science/pith/ZFDMDFOLE6CCK2TDVENJELUOHM/action/replication_record"}},"created_at":"2026-07-05T06:13:56.832156+00:00","updated_at":"2026-07-05T06:13:56.832156+00:00"}