{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C24EC7EFO3OSMFTRUPZKCYAZSE","short_pith_number":"pith:C24EC7EF","canonical_record":{"source":{"id":"1506.04487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-15T06:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"96fb33db3a8e81d9d9ecc81ba4261ad930fab3f3a2b612854331eeb688b21889","abstract_canon_sha256":"ae2ee0deebd906ff98f60e4b42e0b85d85fd95a5c0bccc12753cdb0473a57683"},"schema_version":"1.0"},"canonical_sha256":"16b8417c8576dd261671a3f2a1601991222d5b2650468f749bdfeb4583715fe1","source":{"kind":"arxiv","id":"1506.04487","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04487","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04487v2","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04487","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"C24EC7EFO3OS","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C24EC7EFO3OSMFTR","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C24EC7EF","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C24EC7EFO3OSMFTRUPZKCYAZSE","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-15T06:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"96fb33db3a8e81d9d9ecc81ba4261ad930fab3f3a2b612854331eeb688b21889","abstract_canon_sha256":"ae2ee0deebd906ff98f60e4b42e0b85d85fd95a5c0bccc12753cdb0473a57683"},"schema_version":"1.0"},"canonical_sha256":"16b8417c8576dd261671a3f2a1601991222d5b2650468f749bdfeb4583715fe1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:06.007151Z","signature_b64":"FPJHMHa6WrkVIlGWTyXUrGMfMPpgK7/g8E5uHHfk1hme+AWUKKtv0kwguP5IhAksaLz5X8AnjmDybMO5JMXaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16b8417c8576dd261671a3f2a1601991222d5b2650468f749bdfeb4583715fe1","last_reissued_at":"2026-05-18T01:48:06.006496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:06.006496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04487","source_version":2,"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-18T01:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTt6wSIgWF2GbkFv1eqVwuQsRDDwBUZkYMGq9rELow7gFV3spUn2EBa8UWjFRjVzfh9LIJ+IB0MA49YdeHhNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:36:32.041387Z"},"content_sha256":"a94c21aeab39812290b3163f86b28ce2af9eb10e0d3e9935cd3c9977929d9dfe","schema_version":"1.0","event_id":"sha256:a94c21aeab39812290b3163f86b28ce2af9eb10e0d3e9935cd3c9977929d9dfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C24EC7EFO3OSMFTRUPZKCYAZSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient second-order cone programming approach for optimal selection 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":"2015-06-15T06:10:01Z","abstract_excerpt":"An important problem in tree breeding is optimal selection from candidate pedigree members to produce the highest performance in seed orchards, while conserving essential genetic diversity. The most beneficial members should contribute as much as possible, but such selection of orchard parents would reduce performance of the orchard progeny due to serious inbreeding. To avoid inbreeding, we should include a constraint on the numerator relationship matrix to keep a group coancestry under an appropriate threshold. Though an SDP (semidefinite programming) approach proposed by Pong-Wong and Woolli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04487","kind":"arxiv","version":2},"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-18T01:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwTVHu35SlH/zIvA94N2s9FAT/KS168duLcIv3DpvlssGKy4RgBzzev+fz4mnP3m2Vz14Y0REI4MaD9RZRrqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:36:32.042133Z"},"content_sha256":"ccdb6e3a61d0b2445a02e14e9f6cc6da57f5aa4c33710574ff6f272ffd891bad","schema_version":"1.0","event_id":"sha256:ccdb6e3a61d0b2445a02e14e9f6cc6da57f5aa4c33710574ff6f272ffd891bad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C24EC7EFO3OSMFTRUPZKCYAZSE/bundle.json","state_url":"https://pith.science/pith/C24EC7EFO3OSMFTRUPZKCYAZSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C24EC7EFO3OSMFTRUPZKCYAZSE/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-11T06:36:32Z","links":{"resolver":"https://pith.science/pith/C24EC7EFO3OSMFTRUPZKCYAZSE","bundle":"https://pith.science/pith/C24EC7EFO3OSMFTRUPZKCYAZSE/bundle.json","state":"https://pith.science/pith/C24EC7EFO3OSMFTRUPZKCYAZSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C24EC7EFO3OSMFTRUPZKCYAZSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C24EC7EFO3OSMFTRUPZKCYAZSE","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":"ae2ee0deebd906ff98f60e4b42e0b85d85fd95a5c0bccc12753cdb0473a57683","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-15T06:10:01Z","title_canon_sha256":"96fb33db3a8e81d9d9ecc81ba4261ad930fab3f3a2b612854331eeb688b21889"},"schema_version":"1.0","source":{"id":"1506.04487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04487","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04487v2","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04487","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"C24EC7EFO3OS","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C24EC7EFO3OSMFTR","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C24EC7EF","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:ccdb6e3a61d0b2445a02e14e9f6cc6da57f5aa4c33710574ff6f272ffd891bad","target":"graph","created_at":"2026-05-18T01:48:06Z","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":"An important problem in tree breeding is optimal selection from candidate pedigree members to produce the highest performance in seed orchards, while conserving essential genetic diversity. The most beneficial members should contribute as much as possible, but such selection of orchard parents would reduce performance of the orchard progeny due to serious inbreeding. To avoid inbreeding, we should include a constraint on the numerator relationship matrix to keep a group coancestry under an appropriate threshold. Though an SDP (semidefinite programming) approach proposed by Pong-Wong and Woolli","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":"2015-06-15T06:10:01Z","title":"An efficient second-order cone programming approach for optimal selection in tree breeding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04487","kind":"arxiv","version":2},"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:a94c21aeab39812290b3163f86b28ce2af9eb10e0d3e9935cd3c9977929d9dfe","target":"record","created_at":"2026-05-18T01:48:06Z","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":"ae2ee0deebd906ff98f60e4b42e0b85d85fd95a5c0bccc12753cdb0473a57683","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-15T06:10:01Z","title_canon_sha256":"96fb33db3a8e81d9d9ecc81ba4261ad930fab3f3a2b612854331eeb688b21889"},"schema_version":"1.0","source":{"id":"1506.04487","kind":"arxiv","version":2}},"canonical_sha256":"16b8417c8576dd261671a3f2a1601991222d5b2650468f749bdfeb4583715fe1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16b8417c8576dd261671a3f2a1601991222d5b2650468f749bdfeb4583715fe1","first_computed_at":"2026-05-18T01:48:06.006496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:48:06.006496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FPJHMHa6WrkVIlGWTyXUrGMfMPpgK7/g8E5uHHfk1hme+AWUKKtv0kwguP5IhAksaLz5X8AnjmDybMO5JMXaAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:48:06.007151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a94c21aeab39812290b3163f86b28ce2af9eb10e0d3e9935cd3c9977929d9dfe","sha256:ccdb6e3a61d0b2445a02e14e9f6cc6da57f5aa4c33710574ff6f272ffd891bad"],"state_sha256":"f4816cdbc62dd5515220bf3957d485d9b18302fe6870ae33ca69fffee11017b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWqIRMAAwTcXOQB9rhQZSh+JUReqfh66y4aoHO876FRcdVJys4UzZYy84Y1YPLl1CvTqsGhf2pZTklRFDCUZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:36:32.046397Z","bundle_sha256":"4b99823e92e7e9638f03a495b30f83771a28a02b4f2c49aaeb2cd70de657159e"}}