{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DPLQ6VBYTHFQ2LNBR2HX5HNWSJ","short_pith_number":"pith:DPLQ6VBY","canonical_record":{"source":{"id":"1606.04670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-15T08:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"78de8438e87bfb122c11a728ad04fd2f7c3761fedad8dbcbaa51ef3668e53d92","abstract_canon_sha256":"44ae5d9d6cfb4bb0a0834fd649a65c4de26c9a4d3fe0fd7b27fb646ceaf2bdd6"},"schema_version":"1.0"},"canonical_sha256":"1bd70f543899cb0d2da18e8f7e9db69250f0a498121d24fa01cc1eacda8a6f15","source":{"kind":"arxiv","id":"1606.04670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04670","created_at":"2026-05-18T00:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04670v1","created_at":"2026-05-18T00:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04670","created_at":"2026-05-18T00:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"DPLQ6VBYTHFQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPLQ6VBYTHFQ2LNB","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPLQ6VBY","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DPLQ6VBYTHFQ2LNBR2HX5HNWSJ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-15T08:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"78de8438e87bfb122c11a728ad04fd2f7c3761fedad8dbcbaa51ef3668e53d92","abstract_canon_sha256":"44ae5d9d6cfb4bb0a0834fd649a65c4de26c9a4d3fe0fd7b27fb646ceaf2bdd6"},"schema_version":"1.0"},"canonical_sha256":"1bd70f543899cb0d2da18e8f7e9db69250f0a498121d24fa01cc1eacda8a6f15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:48.455535Z","signature_b64":"Qi7qJe2Uen9yjRqbmL/ch2Q1ttVLMWnf6pwU38UoZM87eqUmNzR41LsoszprKvEobwMV3n9yuwoWYCL2ewKnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bd70f543899cb0d2da18e8f7e9db69250f0a498121d24fa01cc1eacda8a6f15","last_reissued_at":"2026-05-18T00:37:48.454934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:48.454934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04670","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:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0qwpipfg9mPYVth6tydfWGxeCXmyly7l+SPq+qjmrzUrwEQ/bJq2lT7ue+mO7RXZZVBTF1mAZf/Mhupurn4jDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:40:38.823250Z"},"content_sha256":"98a2feb3f8828bd7442d2215a8b36a634494d6524b91c8c24e828d852278ff2a","schema_version":"1.0","event_id":"sha256:98a2feb3f8828bd7442d2215a8b36a634494d6524b91c8c24e828d852278ff2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DPLQ6VBYTHFQ2LNBR2HX5HNWSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Redundancy Optimization of Finite-Dimensional Structures: A Concept and a Derivative-Free Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yoshihiro Kanno","submitted_at":"2016-06-15T08:18:32Z","abstract_excerpt":"Redundancy is related to the amount of functionality that the structure can sustain in the worst-case scenario of structural degradation. This paper proposes a widely-applicable concept of redundancy optimization of finite-dimensional structures. The concept is consistent with the robust structural optimization, as well as the quantitative measure of structural redundancy based on the information-gap theory. A derivative-free algorithm is proposed based on the sequential quadratic programming (SQP) method, where we use the finite-difference method with adaptively varying the difference increme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04670","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:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/t2pHqkvrb4VWx3aojDVC77QatU7pAgwOVT5r9n2KX0Sj82xx3ao2t/t+sJp6cdo+ZMpdHC5omkuUiZMTfScBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:40:38.823630Z"},"content_sha256":"2d4657d9444681920976a99719371942aae63612e23e11343858a1267f355423","schema_version":"1.0","event_id":"sha256:2d4657d9444681920976a99719371942aae63612e23e11343858a1267f355423"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPLQ6VBYTHFQ2LNBR2HX5HNWSJ/bundle.json","state_url":"https://pith.science/pith/DPLQ6VBYTHFQ2LNBR2HX5HNWSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPLQ6VBYTHFQ2LNBR2HX5HNWSJ/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-07-05T07:40:38Z","links":{"resolver":"https://pith.science/pith/DPLQ6VBYTHFQ2LNBR2HX5HNWSJ","bundle":"https://pith.science/pith/DPLQ6VBYTHFQ2LNBR2HX5HNWSJ/bundle.json","state":"https://pith.science/pith/DPLQ6VBYTHFQ2LNBR2HX5HNWSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPLQ6VBYTHFQ2LNBR2HX5HNWSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DPLQ6VBYTHFQ2LNBR2HX5HNWSJ","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":"44ae5d9d6cfb4bb0a0834fd649a65c4de26c9a4d3fe0fd7b27fb646ceaf2bdd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-15T08:18:32Z","title_canon_sha256":"78de8438e87bfb122c11a728ad04fd2f7c3761fedad8dbcbaa51ef3668e53d92"},"schema_version":"1.0","source":{"id":"1606.04670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04670","created_at":"2026-05-18T00:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04670v1","created_at":"2026-05-18T00:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04670","created_at":"2026-05-18T00:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"DPLQ6VBYTHFQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DPLQ6VBYTHFQ2LNB","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DPLQ6VBY","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:2d4657d9444681920976a99719371942aae63612e23e11343858a1267f355423","target":"graph","created_at":"2026-05-18T00:37:48Z","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":"Redundancy is related to the amount of functionality that the structure can sustain in the worst-case scenario of structural degradation. This paper proposes a widely-applicable concept of redundancy optimization of finite-dimensional structures. The concept is consistent with the robust structural optimization, as well as the quantitative measure of structural redundancy based on the information-gap theory. A derivative-free algorithm is proposed based on the sequential quadratic programming (SQP) method, where we use the finite-difference method with adaptively varying the difference increme","authors_text":"Yoshihiro Kanno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-15T08:18:32Z","title":"Redundancy Optimization of Finite-Dimensional Structures: A Concept and a Derivative-Free Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04670","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:98a2feb3f8828bd7442d2215a8b36a634494d6524b91c8c24e828d852278ff2a","target":"record","created_at":"2026-05-18T00:37:48Z","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":"44ae5d9d6cfb4bb0a0834fd649a65c4de26c9a4d3fe0fd7b27fb646ceaf2bdd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-15T08:18:32Z","title_canon_sha256":"78de8438e87bfb122c11a728ad04fd2f7c3761fedad8dbcbaa51ef3668e53d92"},"schema_version":"1.0","source":{"id":"1606.04670","kind":"arxiv","version":1}},"canonical_sha256":"1bd70f543899cb0d2da18e8f7e9db69250f0a498121d24fa01cc1eacda8a6f15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bd70f543899cb0d2da18e8f7e9db69250f0a498121d24fa01cc1eacda8a6f15","first_computed_at":"2026-05-18T00:37:48.454934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:48.454934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qi7qJe2Uen9yjRqbmL/ch2Q1ttVLMWnf6pwU38UoZM87eqUmNzR41LsoszprKvEobwMV3n9yuwoWYCL2ewKnAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:48.455535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98a2feb3f8828bd7442d2215a8b36a634494d6524b91c8c24e828d852278ff2a","sha256:2d4657d9444681920976a99719371942aae63612e23e11343858a1267f355423"],"state_sha256":"b0e3371f6264b841a340b4f077344f1e9bf8215fc2518df21f482ac0b11721af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3fNbCsYoQ3Ffeul9oVPItpyXqD052KdZICR1mNY+W/T72vhSj18jkdGm8yjlbx3e+5Fjb8xruZV27UhxF0fVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T07:40:38.825455Z","bundle_sha256":"a35d44144b1dc50d19576c7aade49d5402b2690631133f23798125e80e0c042e"}}