{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IY6AXD5SAFV53FBHURBSV6CPOE","short_pith_number":"pith:IY6AXD5S","canonical_record":{"source":{"id":"1805.03809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-10T04:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"6865293820047fee1e6e43ba27448e52601610c66879b0f337aee28774d506e8","abstract_canon_sha256":"59868b548709e5512a2574710c9573c2d5896c6963d194b9c00670587bd2f793"},"schema_version":"1.0"},"canonical_sha256":"463c0b8fb2016bdd9427a4432af84f710d3642bb14ab50367801bda4a003d180","source":{"kind":"arxiv","id":"1805.03809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03809","created_at":"2026-05-18T00:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03809v1","created_at":"2026-05-18T00:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03809","created_at":"2026-05-18T00:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"IY6AXD5SAFV5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IY6AXD5SAFV53FBH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IY6AXD5S","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IY6AXD5SAFV53FBHURBSV6CPOE","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-10T04:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"6865293820047fee1e6e43ba27448e52601610c66879b0f337aee28774d506e8","abstract_canon_sha256":"59868b548709e5512a2574710c9573c2d5896c6963d194b9c00670587bd2f793"},"schema_version":"1.0"},"canonical_sha256":"463c0b8fb2016bdd9427a4432af84f710d3642bb14ab50367801bda4a003d180","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:18.701951Z","signature_b64":"IoC8FHGwkXgJU/ueeS5+Hv3SZOcOgnUElmQUwIuFkunIkVJc3+GSVG1Ms/UElf+4U88OXk8qH38CXidwd222Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"463c0b8fb2016bdd9427a4432af84f710d3642bb14ab50367801bda4a003d180","last_reissued_at":"2026-05-18T00:16:18.701467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:18.701467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03809","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:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvlybWit+814C+g0p1kJCZMp4KwDo3l7KNxAbfE5TWGCO/8zBBkPP0JR30duvrSFxvauWrfzc9MZDI84xCpSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:13:21.626464Z"},"content_sha256":"6051c818fbfb93cb34917d1e6bb6010f808ac9edd6471965dd95506789267bf5","schema_version":"1.0","event_id":"sha256:6051c818fbfb93cb34917d1e6bb6010f808ac9edd6471965dd95506789267bf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IY6AXD5SAFV53FBHURBSV6CPOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polyhedral-based Methods for Mixed-Integer SOCP in Tree Breeding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Makoto Yamashita, Sena Safarina, Tim J. Mullin","submitted_at":"2018-05-10T04:19:37Z","abstract_excerpt":"Optimal contribution selection (OCS) is a mathematical optimization problem that aims to maximize the total benefit from selecting a group of individuals under a constraint on genetic diversity. We are specifically focused on OCS as applied to forest tree breeding, when selected individuals will contribute equally to the gene pool. Since the diversity constraint in OCS can be described with a second-order cone, equal deployment in OCS can be mathematically modeled as mixed-integer second-order cone programming (MI-SOCP). If we apply a general solver for MI-SOCP, non-linearity embedded in OCS r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03809","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:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXUwdSzEpxerIBLyhUqaE2JknpDo81VvWaoVgtP3gnF3GGFhqz+rzcwkPDvTTYG5dyg1+T5DkljTzTXYEHM7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:13:21.626818Z"},"content_sha256":"403f89c78416689b84af5f7f09c2bb2b10ba1227eca6dd37a836671c58fa6d2f","schema_version":"1.0","event_id":"sha256:403f89c78416689b84af5f7f09c2bb2b10ba1227eca6dd37a836671c58fa6d2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IY6AXD5SAFV53FBHURBSV6CPOE/bundle.json","state_url":"https://pith.science/pith/IY6AXD5SAFV53FBHURBSV6CPOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IY6AXD5SAFV53FBHURBSV6CPOE/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-11T12:13:21Z","links":{"resolver":"https://pith.science/pith/IY6AXD5SAFV53FBHURBSV6CPOE","bundle":"https://pith.science/pith/IY6AXD5SAFV53FBHURBSV6CPOE/bundle.json","state":"https://pith.science/pith/IY6AXD5SAFV53FBHURBSV6CPOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IY6AXD5SAFV53FBHURBSV6CPOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IY6AXD5SAFV53FBHURBSV6CPOE","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":"59868b548709e5512a2574710c9573c2d5896c6963d194b9c00670587bd2f793","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-10T04:19:37Z","title_canon_sha256":"6865293820047fee1e6e43ba27448e52601610c66879b0f337aee28774d506e8"},"schema_version":"1.0","source":{"id":"1805.03809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03809","created_at":"2026-05-18T00:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03809v1","created_at":"2026-05-18T00:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03809","created_at":"2026-05-18T00:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"IY6AXD5SAFV5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IY6AXD5SAFV53FBH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IY6AXD5S","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:403f89c78416689b84af5f7f09c2bb2b10ba1227eca6dd37a836671c58fa6d2f","target":"graph","created_at":"2026-05-18T00:16:18Z","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":"Optimal contribution selection (OCS) is a mathematical optimization problem that aims to maximize the total benefit from selecting a group of individuals under a constraint on genetic diversity. We are specifically focused on OCS as applied to forest tree breeding, when selected individuals will contribute equally to the gene pool. Since the diversity constraint in OCS can be described with a second-order cone, equal deployment in OCS can be mathematically modeled as mixed-integer second-order cone programming (MI-SOCP). If we apply a general solver for MI-SOCP, non-linearity embedded in OCS r","authors_text":"Makoto Yamashita, Sena Safarina, Tim J. Mullin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-10T04:19:37Z","title":"Polyhedral-based Methods for Mixed-Integer SOCP in Tree Breeding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03809","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:6051c818fbfb93cb34917d1e6bb6010f808ac9edd6471965dd95506789267bf5","target":"record","created_at":"2026-05-18T00:16:18Z","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":"59868b548709e5512a2574710c9573c2d5896c6963d194b9c00670587bd2f793","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-10T04:19:37Z","title_canon_sha256":"6865293820047fee1e6e43ba27448e52601610c66879b0f337aee28774d506e8"},"schema_version":"1.0","source":{"id":"1805.03809","kind":"arxiv","version":1}},"canonical_sha256":"463c0b8fb2016bdd9427a4432af84f710d3642bb14ab50367801bda4a003d180","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"463c0b8fb2016bdd9427a4432af84f710d3642bb14ab50367801bda4a003d180","first_computed_at":"2026-05-18T00:16:18.701467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:18.701467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IoC8FHGwkXgJU/ueeS5+Hv3SZOcOgnUElmQUwIuFkunIkVJc3+GSVG1Ms/UElf+4U88OXk8qH38CXidwd222Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:18.701951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6051c818fbfb93cb34917d1e6bb6010f808ac9edd6471965dd95506789267bf5","sha256:403f89c78416689b84af5f7f09c2bb2b10ba1227eca6dd37a836671c58fa6d2f"],"state_sha256":"3487cbcfb528f847d8d8a6db555ef6fa05374a2a74ed14b435843de1165b047e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2rJ0x5tz7sSjKtWCTaEj7VJYT+tvw1qmwmr/LOQWjyydQvr+EU3ndAWUwjjsllCarOjXtqORSot58zRMmRXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:13:21.628748Z","bundle_sha256":"9729566302adcbc119baf40bf9ae22e8c7af8bed5019c4841cc2b8b07b2328c8"}}