{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RQMSEUENA7AMRS5O6YF26OKRQT","short_pith_number":"pith:RQMSEUEN","schema_version":"1.0","canonical_sha256":"8c1922508d07c0c8cbaef60baf395184c2353e9125a917e0ebe9ae828e3fbb26","source":{"kind":"arxiv","id":"1712.02919","version":2},"attestation_state":"computed","paper":{"title":"On Topology Optimization and Canonical Duality Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.OC","authors_text":"David Yang Gao","submitted_at":"2017-12-08T02:55:35Z","abstract_excerpt":"Topology optimization for general materials is correctly formulated as a bi-level knapsack problem, which is considered to be NP-hard in global optimization and computer science. By using canonical duality theory (CDT) developed by the author, the linear knapsack problem can be solved analytically to obtain global optimal solution at each design iteration. Both uniqueness, existence, and NP-hardness are discussed. The novel CDT method for general topology optimization is refined and tested by both 2-D and 3-D benchmark problems. Numerical results show that without using filter and any other ar"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.02919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-08T02:55:35Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"f27192f4119892b3a5f6d57d787bdf5aebc0f3fcd763175e587a946bb056e0bc","abstract_canon_sha256":"8a54dad4e54681c45fc6949558403075f320713b35286ee0e201f1e2aa62761e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:10.803422Z","signature_b64":"7YDXski1JTvkPfJvNcdfNuTDb754Xqo5oJtnI/yIRr4dTcQ1u5YcHZj+EmYDthDinLQlGFaerLel6aom9qBwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c1922508d07c0c8cbaef60baf395184c2353e9125a917e0ebe9ae828e3fbb26","last_reissued_at":"2026-05-18T00:08:10.802925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:10.802925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Topology Optimization and Canonical Duality Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.OC","authors_text":"David Yang Gao","submitted_at":"2017-12-08T02:55:35Z","abstract_excerpt":"Topology optimization for general materials is correctly formulated as a bi-level knapsack problem, which is considered to be NP-hard in global optimization and computer science. By using canonical duality theory (CDT) developed by the author, the linear knapsack problem can be solved analytically to obtain global optimal solution at each design iteration. Both uniqueness, existence, and NP-hardness are discussed. The novel CDT method for general topology optimization is refined and tested by both 2-D and 3-D benchmark problems. Numerical results show that without using filter and any other ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02919","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.02919","created_at":"2026-05-18T00:08:10.802995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.02919v2","created_at":"2026-05-18T00:08:10.802995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02919","created_at":"2026-05-18T00:08:10.802995+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQMSEUENA7AM","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQMSEUENA7AMRS5O","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQMSEUEN","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQMSEUENA7AMRS5O6YF26OKRQT","json":"https://pith.science/pith/RQMSEUENA7AMRS5O6YF26OKRQT.json","graph_json":"https://pith.science/api/pith-number/RQMSEUENA7AMRS5O6YF26OKRQT/graph.json","events_json":"https://pith.science/api/pith-number/RQMSEUENA7AMRS5O6YF26OKRQT/events.json","paper":"https://pith.science/paper/RQMSEUEN"},"agent_actions":{"view_html":"https://pith.science/pith/RQMSEUENA7AMRS5O6YF26OKRQT","download_json":"https://pith.science/pith/RQMSEUENA7AMRS5O6YF26OKRQT.json","view_paper":"https://pith.science/paper/RQMSEUEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.02919&json=true","fetch_graph":"https://pith.science/api/pith-number/RQMSEUENA7AMRS5O6YF26OKRQT/graph.json","fetch_events":"https://pith.science/api/pith-number/RQMSEUENA7AMRS5O6YF26OKRQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQMSEUENA7AMRS5O6YF26OKRQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQMSEUENA7AMRS5O6YF26OKRQT/action/storage_attestation","attest_author":"https://pith.science/pith/RQMSEUENA7AMRS5O6YF26OKRQT/action/author_attestation","sign_citation":"https://pith.science/pith/RQMSEUENA7AMRS5O6YF26OKRQT/action/citation_signature","submit_replication":"https://pith.science/pith/RQMSEUENA7AMRS5O6YF26OKRQT/action/replication_record"}},"created_at":"2026-05-18T00:08:10.802995+00:00","updated_at":"2026-05-18T00:08:10.802995+00:00"}