{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EWYDA3RI33OYC5WSTB6EXW6UYC","short_pith_number":"pith:EWYDA3RI","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"},"canonical_sha256":"25b0306e28dedd8176d2987c4bdbd4c0a81d3b027eb8c0a0d995aea440a6e367","source":{"kind":"arxiv","id":"1812.10431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10431","created_at":"2026-05-17T23:57:22Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10431v1","created_at":"2026-05-17T23:57:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10431","created_at":"2026-05-17T23:57:22Z"},{"alias_kind":"pith_short_12","alias_value":"EWYDA3RI33OY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EWYDA3RI33OYC5WS","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EWYDA3RI","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EWYDA3RI33OYC5WSTB6EXW6UYC","target":"record","payload":{"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"},"canonical_sha256":"25b0306e28dedd8176d2987c4bdbd4c0a81d3b027eb8c0a0d995aea440a6e367","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"},"source_kind":"arxiv","source_id":"1812.10431","source_version":1,"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-05-17T23:57:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bjIjnH4iHkzu40pt5J5ZPDwsrSDH/KGYHBstHdACJLkBfOh064BgAAMcgYkq8ReRLPzjo7fL4jzvKjbmEncqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:00:24.767028Z"},"content_sha256":"7c0d73d0a5f238875fc8e0e9425fdff5a31a55a93791064a8b6685846c8a961a","schema_version":"1.0","event_id":"sha256:7c0d73d0a5f238875fc8e0e9425fdff5a31a55a93791064a8b6685846c8a961a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EWYDA3RI33OYC5WSTB6EXW6UYC","target":"graph","payload":{"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"},"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-05-17T23:57:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMEYMcfT/H4hVeBofIzxIgdCTv/Nqn1KMm45Iemiz5R3hiK0KoYCpidhlpDD75v9MITU5ER2UtAr/VcppgYkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:00:24.767455Z"},"content_sha256":"f995a53a3adf73169e972f03d760595c683af84e2550e661fd1560700db84254","schema_version":"1.0","event_id":"sha256:f995a53a3adf73169e972f03d760595c683af84e2550e661fd1560700db84254"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/bundle.json","state_url":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/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-05-26T18:00:24Z","links":{"resolver":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC","bundle":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/bundle.json","state":"https://pith.science/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWYDA3RI33OYC5WSTB6EXW6UYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EWYDA3RI33OYC5WSTB6EXW6UYC","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":"09c77348d1191ffddbd29da7fea22652cd5958ce82792f87561f58d30b6c9311","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-26T17:57:02Z","title_canon_sha256":"1269a474020004d6f64ad1244b5175d79abc15d94d6ae6f46394fae64365459f"},"schema_version":"1.0","source":{"id":"1812.10431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10431","created_at":"2026-05-17T23:57:22Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10431v1","created_at":"2026-05-17T23:57:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10431","created_at":"2026-05-17T23:57:22Z"},{"alias_kind":"pith_short_12","alias_value":"EWYDA3RI33OY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EWYDA3RI33OYC5WS","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EWYDA3RI","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:f995a53a3adf73169e972f03d760595c683af84e2550e661fd1560700db84254","target":"graph","created_at":"2026-05-17T23:57:22Z","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"},"paper":{"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","authors_text":"Vijay K. Garg","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-26T17:57:02Z","title":"Applying Predicate Detection to the Constrained Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10431","kind":"arxiv","version":1},"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:7c0d73d0a5f238875fc8e0e9425fdff5a31a55a93791064a8b6685846c8a961a","target":"record","created_at":"2026-05-17T23:57:22Z","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":"09c77348d1191ffddbd29da7fea22652cd5958ce82792f87561f58d30b6c9311","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-26T17:57:02Z","title_canon_sha256":"1269a474020004d6f64ad1244b5175d79abc15d94d6ae6f46394fae64365459f"},"schema_version":"1.0","source":{"id":"1812.10431","kind":"arxiv","version":1}},"canonical_sha256":"25b0306e28dedd8176d2987c4bdbd4c0a81d3b027eb8c0a0d995aea440a6e367","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25b0306e28dedd8176d2987c4bdbd4c0a81d3b027eb8c0a0d995aea440a6e367","first_computed_at":"2026-05-17T23:57:22.071507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:22.071507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ScOgmLWylEH1791sHaEcvsAD0Der7kPVazgc/TCAUJ6msRuVjSo8dN8nKsmW6cHnG++/5Lgv/6QcLc3fLR4oCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:22.072083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c0d73d0a5f238875fc8e0e9425fdff5a31a55a93791064a8b6685846c8a961a","sha256:f995a53a3adf73169e972f03d760595c683af84e2550e661fd1560700db84254"],"state_sha256":"cfd393f7052d1b83efb7398fd4b7816c228c29326eb381b9bdd6669d8e58c4b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YgsL+xAnqsFtQhjGW6ZBvmbBgB7hZIEWQh0Jq5Rq/b965LQ4WpabJw/3onTnYEwTubtkTv4ZsTxRrWgEUAKEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:00:24.769901Z","bundle_sha256":"9fbd46c78f25c0da1c33833480a5128ffea8e0e9abce09c613f3fee2b8e6a5c2"}}