{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2752IMCTXLTZH62MDAIRAE4BYA","short_pith_number":"pith:2752IMCT","schema_version":"1.0","canonical_sha256":"d7fba43053bae793fb4c1811101381c0353d6ad5342a654e75fca6371127775e","source":{"kind":"arxiv","id":"1503.00275","version":2},"attestation_state":"computed","paper":{"title":"Comparator Circuits over Finite Bounded Posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Jayalal Sarma, K.S. Sunil","submitted_at":"2015-03-01T13:46:11Z","abstract_excerpt":"Comparator circuit model was originally introduced by Mayr and Subramanian (1992) (and further studied by Cook, Filmus and Le (2012)) to capture problems which are not known to be P-complete but still not known to admit efficient parallel algorithms. The class CC is the complexity class of problems many-one logspace reducible to the Comparator Circuit Value Problem and we know that NL is contained in CC which is inturn contained in P. Cook, Filmus and Le (2012) showed that CC is also the class of languages decided by polynomial size comparator circuits.\n  We study generalizations of the compar"},"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":"1503.00275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-01T13:46:11Z","cross_cats_sorted":[],"title_canon_sha256":"25e95242063b0271467b75945d03ad864f6b6d7d7e7be263bafa534e7c6040ff","abstract_canon_sha256":"9fe70d10426bebb04a6a89819f5607ff934ec2c5d15ac7bbf448ce5ab39c4f95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:58.666828Z","signature_b64":"iRKA0nWytvbmB+3ogj1+qqwt5wU1znhE2iicn7VGrR7LsnPJMTpj+jMxz/2xziCbHkBbPvqZ1wlCZGmTlggcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7fba43053bae793fb4c1811101381c0353d6ad5342a654e75fca6371127775e","last_reissued_at":"2026-05-18T00:39:58.666265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:58.666265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparator Circuits over Finite Bounded Posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Jayalal Sarma, K.S. Sunil","submitted_at":"2015-03-01T13:46:11Z","abstract_excerpt":"Comparator circuit model was originally introduced by Mayr and Subramanian (1992) (and further studied by Cook, Filmus and Le (2012)) to capture problems which are not known to be P-complete but still not known to admit efficient parallel algorithms. The class CC is the complexity class of problems many-one logspace reducible to the Comparator Circuit Value Problem and we know that NL is contained in CC which is inturn contained in P. Cook, Filmus and Le (2012) showed that CC is also the class of languages decided by polynomial size comparator circuits.\n  We study generalizations of the compar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00275","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":""},"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":"1503.00275","created_at":"2026-05-18T00:39:58.666364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00275v2","created_at":"2026-05-18T00:39:58.666364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00275","created_at":"2026-05-18T00:39:58.666364+00:00"},{"alias_kind":"pith_short_12","alias_value":"2752IMCTXLTZ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2752IMCTXLTZH62M","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2752IMCT","created_at":"2026-05-18T12:28:59.999130+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/2752IMCTXLTZH62MDAIRAE4BYA","json":"https://pith.science/pith/2752IMCTXLTZH62MDAIRAE4BYA.json","graph_json":"https://pith.science/api/pith-number/2752IMCTXLTZH62MDAIRAE4BYA/graph.json","events_json":"https://pith.science/api/pith-number/2752IMCTXLTZH62MDAIRAE4BYA/events.json","paper":"https://pith.science/paper/2752IMCT"},"agent_actions":{"view_html":"https://pith.science/pith/2752IMCTXLTZH62MDAIRAE4BYA","download_json":"https://pith.science/pith/2752IMCTXLTZH62MDAIRAE4BYA.json","view_paper":"https://pith.science/paper/2752IMCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00275&json=true","fetch_graph":"https://pith.science/api/pith-number/2752IMCTXLTZH62MDAIRAE4BYA/graph.json","fetch_events":"https://pith.science/api/pith-number/2752IMCTXLTZH62MDAIRAE4BYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2752IMCTXLTZH62MDAIRAE4BYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2752IMCTXLTZH62MDAIRAE4BYA/action/storage_attestation","attest_author":"https://pith.science/pith/2752IMCTXLTZH62MDAIRAE4BYA/action/author_attestation","sign_citation":"https://pith.science/pith/2752IMCTXLTZH62MDAIRAE4BYA/action/citation_signature","submit_replication":"https://pith.science/pith/2752IMCTXLTZH62MDAIRAE4BYA/action/replication_record"}},"created_at":"2026-05-18T00:39:58.666364+00:00","updated_at":"2026-05-18T00:39:58.666364+00:00"}