{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XX4NNVO7S5C5APCDOXHISMJAXB","short_pith_number":"pith:XX4NNVO7","canonical_record":{"source":{"id":"1810.03417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-08T12:58:26Z","cross_cats_sorted":["cs.DC","cs.LG","cs.SE","stat.ML"],"title_canon_sha256":"83160d99be4dc0ba48462efaec77b07719550faabd7eebf637f5808f51125121","abstract_canon_sha256":"ac566d58c51617b62631007c894a04920a330d5a8edb89861c23c9fff9b179fa"},"schema_version":"1.0"},"canonical_sha256":"bdf8d6d5df9745d03c4375ce893120b8438c3ca10e7b2fe3698b934cdd69d43f","source":{"kind":"arxiv","id":"1810.03417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03417","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03417v1","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03417","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"pith_short_12","alias_value":"XX4NNVO7S5C5","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"XX4NNVO7S5C5APCD","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"XX4NNVO7","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XX4NNVO7S5C5APCDOXHISMJAXB","target":"record","payload":{"canonical_record":{"source":{"id":"1810.03417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-08T12:58:26Z","cross_cats_sorted":["cs.DC","cs.LG","cs.SE","stat.ML"],"title_canon_sha256":"83160d99be4dc0ba48462efaec77b07719550faabd7eebf637f5808f51125121","abstract_canon_sha256":"ac566d58c51617b62631007c894a04920a330d5a8edb89861c23c9fff9b179fa"},"schema_version":"1.0"},"canonical_sha256":"bdf8d6d5df9745d03c4375ce893120b8438c3ca10e7b2fe3698b934cdd69d43f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:51.362781Z","signature_b64":"/2k7CWs1wIVSmtkDxpuS/c2tlA1blG90YQkXXYq18Kkrxu5URTcGhf7zzskHO3bRT6lut0AbN6u1mgtnLD3uCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdf8d6d5df9745d03c4375ce893120b8438c3ca10e7b2fe3698b934cdd69d43f","last_reissued_at":"2026-05-18T00:03:51.362185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:51.362185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.03417","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-18T00:03:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CG8Tx1KLUhbTOUNFOqwOHiq/zWBe97OyxmmuTGG8UN8bhfro7sT/aLKol/VQ46u7qVZuju6ngV9linz3kbeJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:50:16.379718Z"},"content_sha256":"b2eb231a62d665080c7ec824e7402b71a1926f336fea7d5139786998616e17c6","schema_version":"1.0","event_id":"sha256:b2eb231a62d665080c7ec824e7402b71a1926f336fea7d5139786998616e17c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XX4NNVO7S5C5APCDOXHISMJAXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"POLO: a POLicy-based Optimization library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.SE","stat.ML"],"primary_cat":"math.OC","authors_text":"Arda Aytekin, Martin Biel, Mikael Johansson","submitted_at":"2018-10-08T12:58:26Z","abstract_excerpt":"We present POLO --- a C++ library for large-scale parallel optimization research that emphasizes ease-of-use, flexibility and efficiency in algorithm design. It uses multiple inheritance and template programming to decompose algorithms into essential policies and facilitate code reuse. With its clear separation between algorithm and execution policies, it provides researchers with a simple and powerful platform for prototyping ideas, evaluating them on different parallel computing architectures and hardware platforms, and generating compact and efficient production code. A C-API is included fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03417","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-18T00:03:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FN4Cy6DUys5Pe5UoZGdyccaVB2lKNmt3LzdEG9OghXQrXnBMH6HOyuungwmyMpkn/emonl6oKp/C5O8OY7IgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:50:16.380066Z"},"content_sha256":"76db467ba161df9ad80b3a957675bbd2a18ff878cee659726ce7a241c1de7bcb","schema_version":"1.0","event_id":"sha256:76db467ba161df9ad80b3a957675bbd2a18ff878cee659726ce7a241c1de7bcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XX4NNVO7S5C5APCDOXHISMJAXB/bundle.json","state_url":"https://pith.science/pith/XX4NNVO7S5C5APCDOXHISMJAXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XX4NNVO7S5C5APCDOXHISMJAXB/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-06-02T07:50:16Z","links":{"resolver":"https://pith.science/pith/XX4NNVO7S5C5APCDOXHISMJAXB","bundle":"https://pith.science/pith/XX4NNVO7S5C5APCDOXHISMJAXB/bundle.json","state":"https://pith.science/pith/XX4NNVO7S5C5APCDOXHISMJAXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XX4NNVO7S5C5APCDOXHISMJAXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XX4NNVO7S5C5APCDOXHISMJAXB","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":"ac566d58c51617b62631007c894a04920a330d5a8edb89861c23c9fff9b179fa","cross_cats_sorted":["cs.DC","cs.LG","cs.SE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-08T12:58:26Z","title_canon_sha256":"83160d99be4dc0ba48462efaec77b07719550faabd7eebf637f5808f51125121"},"schema_version":"1.0","source":{"id":"1810.03417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03417","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03417v1","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03417","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"pith_short_12","alias_value":"XX4NNVO7S5C5","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"XX4NNVO7S5C5APCD","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"XX4NNVO7","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:76db467ba161df9ad80b3a957675bbd2a18ff878cee659726ce7a241c1de7bcb","target":"graph","created_at":"2026-05-18T00:03:51Z","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 POLO --- a C++ library for large-scale parallel optimization research that emphasizes ease-of-use, flexibility and efficiency in algorithm design. It uses multiple inheritance and template programming to decompose algorithms into essential policies and facilitate code reuse. With its clear separation between algorithm and execution policies, it provides researchers with a simple and powerful platform for prototyping ideas, evaluating them on different parallel computing architectures and hardware platforms, and generating compact and efficient production code. A C-API is included fo","authors_text":"Arda Aytekin, Martin Biel, Mikael Johansson","cross_cats":["cs.DC","cs.LG","cs.SE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-08T12:58:26Z","title":"POLO: a POLicy-based Optimization library"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03417","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:b2eb231a62d665080c7ec824e7402b71a1926f336fea7d5139786998616e17c6","target":"record","created_at":"2026-05-18T00:03:51Z","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":"ac566d58c51617b62631007c894a04920a330d5a8edb89861c23c9fff9b179fa","cross_cats_sorted":["cs.DC","cs.LG","cs.SE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-08T12:58:26Z","title_canon_sha256":"83160d99be4dc0ba48462efaec77b07719550faabd7eebf637f5808f51125121"},"schema_version":"1.0","source":{"id":"1810.03417","kind":"arxiv","version":1}},"canonical_sha256":"bdf8d6d5df9745d03c4375ce893120b8438c3ca10e7b2fe3698b934cdd69d43f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdf8d6d5df9745d03c4375ce893120b8438c3ca10e7b2fe3698b934cdd69d43f","first_computed_at":"2026-05-18T00:03:51.362185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:51.362185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/2k7CWs1wIVSmtkDxpuS/c2tlA1blG90YQkXXYq18Kkrxu5URTcGhf7zzskHO3bRT6lut0AbN6u1mgtnLD3uCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:51.362781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2eb231a62d665080c7ec824e7402b71a1926f336fea7d5139786998616e17c6","sha256:76db467ba161df9ad80b3a957675bbd2a18ff878cee659726ce7a241c1de7bcb"],"state_sha256":"4eaefaa44b345b69118c5890c12bf5eca1d54d23dc780256c478a18e3b9753ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tpshpqYxSeJugf917zM+AqbudiimBn3rG9sX/Uodx0nNxegZsw0XOJSZtBV2fq23UOsOFOVGA25AJ3dtJw/4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:50:16.382141Z","bundle_sha256":"95544825f94072ade5172ea8e1c695b0ae3fe11cd3af129be5927cd4e136277d"}}