{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EWYDA3RI33OYC5WSTB6EXW6UYC","short_pith_number":"pith:EWYDA3RI","schema_version":"1.0","canonical_sha256":"25b0306e28dedd8176d2987c4bdbd4c0a81d3b027eb8c0a0d995aea440a6e367","source":{"kind":"arxiv","id":"1812.10431","version":1},"attestation_state":"computed","paper":{"title":"Applying Predicate Detection to the Constrained Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Vijay K. Garg","submitted_at":"2018-12-26T17:57:02Z","abstract_excerpt":"We present a method to design parallel algorithms for constrained combinatorial optimization problems. Our method solves and generalizes many classical combinatorial optimization problems including the stable marriage problem, the shortest path problem and the market clearing price problem. These three problems are solved in the literature using Gale-Shapley algorithm, Dijkstra's algorithm, and Demange, Gale, Sotomayor algorithm. Our method solves all these problems by casting them as searching for an element that satisfies an appropriate predicate in a distributive lattice. Moreover, it solve"},"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":"1812.10431","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-26T17:57:02Z","cross_cats_sorted":[],"title_canon_sha256":"1269a474020004d6f64ad1244b5175d79abc15d94d6ae6f46394fae64365459f","abstract_canon_sha256":"09c77348d1191ffddbd29da7fea22652cd5958ce82792f87561f58d30b6c9311"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:22.072083Z","signature_b64":"ScOgmLWylEH1791sHaEcvsAD0Der7kPVazgc/TCAUJ6msRuVjSo8dN8nKsmW6cHnG++/5Lgv/6QcLc3fLR4oCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25b0306e28dedd8176d2987c4bdbd4c0a81d3b027eb8c0a0d995aea440a6e367","last_reissued_at":"2026-05-17T23:57:22.071507Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:22.071507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Applying Predicate Detection to the Constrained Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Vijay K. Garg","submitted_at":"2018-12-26T17:57:02Z","abstract_excerpt":"We present a method to design parallel algorithms for constrained combinatorial optimization problems. Our method solves and generalizes many classical combinatorial optimization problems including the stable marriage problem, the shortest path problem and the market clearing price problem. These three problems are solved in the literature using Gale-Shapley algorithm, Dijkstra's algorithm, and Demange, Gale, Sotomayor algorithm. Our method solves all these problems by casting them as searching for an element that satisfies an appropriate predicate in a distributive lattice. Moreover, it solve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10431","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":""},"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":"1812.10431","created_at":"2026-05-17T23:57:22.071615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10431v1","created_at":"2026-05-17T23:57:22.071615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10431","created_at":"2026-05-17T23:57:22.071615+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWYDA3RI33OY","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWYDA3RI33OYC5WS","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWYDA3RI","created_at":"2026-05-18T12:32:22.470017+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/EWYDA3RI33OYC5WSTB6EXW6UYC","json":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC.json","graph_json":"https://pith.science/api/pith-number/EWYDA3RI33OYC5WSTB6EXW6UYC/graph.json","events_json":"https://pith.science/api/pith-number/EWYDA3RI33OYC5WSTB6EXW6UYC/events.json","paper":"https://pith.science/paper/EWYDA3RI"},"agent_actions":{"view_html":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC","download_json":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC.json","view_paper":"https://pith.science/paper/EWYDA3RI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10431&json=true","fetch_graph":"https://pith.science/api/pith-number/EWYDA3RI33OYC5WSTB6EXW6UYC/graph.json","fetch_events":"https://pith.science/api/pith-number/EWYDA3RI33OYC5WSTB6EXW6UYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/action/storage_attestation","attest_author":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/action/author_attestation","sign_citation":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/action/citation_signature","submit_replication":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/action/replication_record"}},"created_at":"2026-05-17T23:57:22.071615+00:00","updated_at":"2026-05-17T23:57:22.071615+00:00"}