{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TN6VADWRDDU4I2WCJO4T7KL6YC","short_pith_number":"pith:TN6VADWR","schema_version":"1.0","canonical_sha256":"9b7d500ed118e9c46ac24bb93fa97ec0a02ec2aefd2d77d22f7edd7cf1549f77","source":{"kind":"arxiv","id":"1711.08494","version":3},"attestation_state":"computed","paper":{"title":"Deterministic parallel algorithms for bilinear objective functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David G. Harris","submitted_at":"2017-11-22T20:21:26Z","abstract_excerpt":"Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low independence. A series of papers, beginning with work by Luby (1988), showed that in many cases these techniques can be combined to give deterministic parallel (NC) algorithms for a variety of combinatorial optimization problems, with low time- and processor-complexity.\n  We extend and generalize a technique of Luby for efficiently handling bilinear objective functions. One noteworthy application is an NC algorithm for maximal independent set. On a graph"},"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":"1711.08494","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T20:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"6b56bce489dd5a22a5e2fd8165d4c5e126a842aefa349afa270ed8cb93538c4e","abstract_canon_sha256":"13f4b2a87e10373a760cb6145917e6b05df0bbcfa7cdc1270815275e57ce346b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:59:49.278579Z","signature_b64":"BPBiVNtyTO3XgWcXgGl9hkaeQMDk7Mbpkwv489PZ9lfudbmCQf8gzM0Xae7XIDUZRH7/cPosaR6gw5aKf5+fAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b7d500ed118e9c46ac24bb93fa97ec0a02ec2aefd2d77d22f7edd7cf1549f77","last_reissued_at":"2026-07-05T06:59:49.278116Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:59:49.278116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic parallel algorithms for bilinear objective functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David G. Harris","submitted_at":"2017-11-22T20:21:26Z","abstract_excerpt":"Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low independence. A series of papers, beginning with work by Luby (1988), showed that in many cases these techniques can be combined to give deterministic parallel (NC) algorithms for a variety of combinatorial optimization problems, with low time- and processor-complexity.\n  We extend and generalize a technique of Luby for efficiently handling bilinear objective functions. One noteworthy application is an NC algorithm for maximal independent set. On a graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08494","kind":"arxiv","version":3},"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/1711.08494/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":"1711.08494","created_at":"2026-07-05T06:59:49.278172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08494v3","created_at":"2026-07-05T06:59:49.278172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08494","created_at":"2026-07-05T06:59:49.278172+00:00"},{"alias_kind":"pith_short_12","alias_value":"TN6VADWRDDU4","created_at":"2026-07-05T06:59:49.278172+00:00"},{"alias_kind":"pith_short_16","alias_value":"TN6VADWRDDU4I2WC","created_at":"2026-07-05T06:59:49.278172+00:00"},{"alias_kind":"pith_short_8","alias_value":"TN6VADWR","created_at":"2026-07-05T06:59:49.278172+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08296","citing_title":"Truly Work-efficient Parallel Deterministic $(\\Delta+1)$-coloring and Maximal Independent Set","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TN6VADWRDDU4I2WCJO4T7KL6YC","json":"https://pith.science/pith/TN6VADWRDDU4I2WCJO4T7KL6YC.json","graph_json":"https://pith.science/api/pith-number/TN6VADWRDDU4I2WCJO4T7KL6YC/graph.json","events_json":"https://pith.science/api/pith-number/TN6VADWRDDU4I2WCJO4T7KL6YC/events.json","paper":"https://pith.science/paper/TN6VADWR"},"agent_actions":{"view_html":"https://pith.science/pith/TN6VADWRDDU4I2WCJO4T7KL6YC","download_json":"https://pith.science/pith/TN6VADWRDDU4I2WCJO4T7KL6YC.json","view_paper":"https://pith.science/paper/TN6VADWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08494&json=true","fetch_graph":"https://pith.science/api/pith-number/TN6VADWRDDU4I2WCJO4T7KL6YC/graph.json","fetch_events":"https://pith.science/api/pith-number/TN6VADWRDDU4I2WCJO4T7KL6YC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TN6VADWRDDU4I2WCJO4T7KL6YC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TN6VADWRDDU4I2WCJO4T7KL6YC/action/storage_attestation","attest_author":"https://pith.science/pith/TN6VADWRDDU4I2WCJO4T7KL6YC/action/author_attestation","sign_citation":"https://pith.science/pith/TN6VADWRDDU4I2WCJO4T7KL6YC/action/citation_signature","submit_replication":"https://pith.science/pith/TN6VADWRDDU4I2WCJO4T7KL6YC/action/replication_record"}},"created_at":"2026-07-05T06:59:49.278172+00:00","updated_at":"2026-07-05T06:59:49.278172+00:00"}