{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7D3PPVEM6F3XKNMMWUONVNUWAA","short_pith_number":"pith:7D3PPVEM","canonical_record":{"source":{"id":"1409.3912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-13T05:45:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e377d295d502d1408f60c8a7ff117dd052424675fcf96c2e68df33bc654f4952","abstract_canon_sha256":"93375a5c67bc3dcad453c33054b0233b0f06b072ad7482daa6d2fd9645593739"},"schema_version":"1.0"},"canonical_sha256":"f8f6f7d48cf17775358cb51cdab69600132b6328349ede77021cb58288265102","source":{"kind":"arxiv","id":"1409.3912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3912","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3912v1","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3912","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"7D3PPVEM6F3X","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7D3PPVEM6F3XKNMM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7D3PPVEM","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7D3PPVEM6F3XKNMMWUONVNUWAA","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-13T05:45:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e377d295d502d1408f60c8a7ff117dd052424675fcf96c2e68df33bc654f4952","abstract_canon_sha256":"93375a5c67bc3dcad453c33054b0233b0f06b072ad7482daa6d2fd9645593739"},"schema_version":"1.0"},"canonical_sha256":"f8f6f7d48cf17775358cb51cdab69600132b6328349ede77021cb58288265102","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:53.398215Z","signature_b64":"wRP6+46O9WYCvloHjxSytOrJ8JBgjD2RMd4USgEV5MvVnq6zkqW0V5+bia6RqdgOfYwAWjBgdmGdspY1ypFNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8f6f7d48cf17775358cb51cdab69600132b6328349ede77021cb58288265102","last_reissued_at":"2026-05-18T02:42:53.397849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:53.397849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3912","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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+fxGRvUEgy+CckKIQLsnWecFjANE1ttgfLp+9+pABFngUpaLjxgbGVUPE2p3KZjqWx0OSirMh9/x+6cEnO7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:48:51.404636Z"},"content_sha256":"806f380f24ef842071feeb3a54f9a3c660c4ad77ef6e4b5c3eb807b09264d4a0","schema_version":"1.0","event_id":"sha256:806f380f24ef842071feeb3a54f9a3c660c4ad77ef6e4b5c3eb807b09264d4a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7D3PPVEM6F3XKNMMWUONVNUWAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Distributed Block Coordinate Descent Methods based on Pairwise Comparison Oracle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kota Matsui, Takafumi Kanamori, Wataru Kumagai","submitted_at":"2014-09-13T05:45:32Z","abstract_excerpt":"This paper provides a block coordinate descent algorithm to solve unconstrained optimization problems. In our algorithm, computation of function values or gradients is not required. Instead, pairwise comparison of function values is used. Our algorithm consists of two steps; one is the direction estimate step and the other is the search step. Both steps require only pairwise comparison of function values, which tells us only the order of function values over two points. In the direction estimate step, a Newton type search direction is estimated. A computation method like block coordinate desce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3912","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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYIZPJQ5ZgP/RF75RoJkdxSbW1zrba6U2UYfvJa/lbnizthKtEIQtgOcB1eIoWWoTYblOiH5bh9QiCgoayuXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:48:51.405339Z"},"content_sha256":"7117056ed56ed8da3ef2d11f42749b10a92b1c85b4e17d880a0ba893abb36d2b","schema_version":"1.0","event_id":"sha256:7117056ed56ed8da3ef2d11f42749b10a92b1c85b4e17d880a0ba893abb36d2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7D3PPVEM6F3XKNMMWUONVNUWAA/bundle.json","state_url":"https://pith.science/pith/7D3PPVEM6F3XKNMMWUONVNUWAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7D3PPVEM6F3XKNMMWUONVNUWAA/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-28T21:48:51Z","links":{"resolver":"https://pith.science/pith/7D3PPVEM6F3XKNMMWUONVNUWAA","bundle":"https://pith.science/pith/7D3PPVEM6F3XKNMMWUONVNUWAA/bundle.json","state":"https://pith.science/pith/7D3PPVEM6F3XKNMMWUONVNUWAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7D3PPVEM6F3XKNMMWUONVNUWAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7D3PPVEM6F3XKNMMWUONVNUWAA","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":"93375a5c67bc3dcad453c33054b0233b0f06b072ad7482daa6d2fd9645593739","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-13T05:45:32Z","title_canon_sha256":"e377d295d502d1408f60c8a7ff117dd052424675fcf96c2e68df33bc654f4952"},"schema_version":"1.0","source":{"id":"1409.3912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3912","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3912v1","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3912","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"7D3PPVEM6F3X","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7D3PPVEM6F3XKNMM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7D3PPVEM","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:7117056ed56ed8da3ef2d11f42749b10a92b1c85b4e17d880a0ba893abb36d2b","target":"graph","created_at":"2026-05-18T02:42:53Z","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":"This paper provides a block coordinate descent algorithm to solve unconstrained optimization problems. In our algorithm, computation of function values or gradients is not required. Instead, pairwise comparison of function values is used. Our algorithm consists of two steps; one is the direction estimate step and the other is the search step. Both steps require only pairwise comparison of function values, which tells us only the order of function values over two points. In the direction estimate step, a Newton type search direction is estimated. A computation method like block coordinate desce","authors_text":"Kota Matsui, Takafumi Kanamori, Wataru Kumagai","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-13T05:45:32Z","title":"Parallel Distributed Block Coordinate Descent Methods based on Pairwise Comparison Oracle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3912","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:806f380f24ef842071feeb3a54f9a3c660c4ad77ef6e4b5c3eb807b09264d4a0","target":"record","created_at":"2026-05-18T02:42:53Z","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":"93375a5c67bc3dcad453c33054b0233b0f06b072ad7482daa6d2fd9645593739","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-13T05:45:32Z","title_canon_sha256":"e377d295d502d1408f60c8a7ff117dd052424675fcf96c2e68df33bc654f4952"},"schema_version":"1.0","source":{"id":"1409.3912","kind":"arxiv","version":1}},"canonical_sha256":"f8f6f7d48cf17775358cb51cdab69600132b6328349ede77021cb58288265102","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8f6f7d48cf17775358cb51cdab69600132b6328349ede77021cb58288265102","first_computed_at":"2026-05-18T02:42:53.397849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:53.397849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wRP6+46O9WYCvloHjxSytOrJ8JBgjD2RMd4USgEV5MvVnq6zkqW0V5+bia6RqdgOfYwAWjBgdmGdspY1ypFNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:53.398215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:806f380f24ef842071feeb3a54f9a3c660c4ad77ef6e4b5c3eb807b09264d4a0","sha256:7117056ed56ed8da3ef2d11f42749b10a92b1c85b4e17d880a0ba893abb36d2b"],"state_sha256":"ee30f1b90753c20dbc42c4445bc4d080b1def59b910ecc9bd9e55293628f4e56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+3eT2Y4Oz7r0EpBllz50NMVpH5V3U7JrWkV1JjBie73xDMn29UTaPtJaP8U6X2dhiER7ynL1Ojcs5S32s4KAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:48:51.408578Z","bundle_sha256":"2f366f41094d77a4e6389ed8264e3924619b3744fe7eec081119edc49875265e"}}