{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FQIHQW2PTMBRDLISF6PCP6PCJH","short_pith_number":"pith:FQIHQW2P","schema_version":"1.0","canonical_sha256":"2c10785b4f9b0311ad122f9e27f9e249cd7a580d6f31caf486dad747c2b4868f","source":{"kind":"arxiv","id":"2005.05436","version":2},"attestation_state":"computed","paper":{"title":"A new generation 99 line Matlab code for compliance Topology Optimization and its extension to 3D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CE","authors_text":"Federico Ferrari, Ole Sigmund","submitted_at":"2020-05-05T14:32:52Z","abstract_excerpt":"Compact and efficient Matlab implementations of compliance Topology Optimization (TO) for 2D and 3D continua are given, consisting of 99 and 125 lines respectively. On discretizations ranging from $3\\cdot 10^{4}$ to $4.8\\cdot10^{5}$ elements, the 2D version, named top99neo, shows speedups from 2.55 to 5.5 times compared to the well-known top88 code (Andreassen-etal 2011). The 3D version, named top3D125, is the most compact and efficient Matlab implementation for 3D TO to date, showing a speedup of 1.9 times compared to the code of Amir-etal 2014, on a discretization with $2.2\\cdot10^{5}$ eleme"},"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":"2005.05436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2020-05-05T14:32:52Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"968433785cbdf91988b45476660501f1df4d189aef35c38843648371fbe854ed","abstract_canon_sha256":"3ce74ff9fefe537cec09eaed92aa7254050f49277a201a821282ca0e883aeb65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:22:45.993397Z","signature_b64":"NxwdSaF5pzrcgnBZHY2VrJInplAhuNM7CQKirhFQZpP+kacnQY8V6UXKZBGe1A28dDbjdsWIan8KQcnTvjy8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c10785b4f9b0311ad122f9e27f9e249cd7a580d6f31caf486dad747c2b4868f","last_reissued_at":"2026-07-05T01:22:45.992913Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:22:45.992913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new generation 99 line Matlab code for compliance Topology Optimization and its extension to 3D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CE","authors_text":"Federico Ferrari, Ole Sigmund","submitted_at":"2020-05-05T14:32:52Z","abstract_excerpt":"Compact and efficient Matlab implementations of compliance Topology Optimization (TO) for 2D and 3D continua are given, consisting of 99 and 125 lines respectively. On discretizations ranging from $3\\cdot 10^{4}$ to $4.8\\cdot10^{5}$ elements, the 2D version, named top99neo, shows speedups from 2.55 to 5.5 times compared to the well-known top88 code (Andreassen-etal 2011). The 3D version, named top3D125, is the most compact and efficient Matlab implementation for 3D TO to date, showing a speedup of 1.9 times compared to the code of Amir-etal 2014, on a discretization with $2.2\\cdot10^{5}$ eleme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.05436","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.05436/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.05436","created_at":"2026-07-05T01:22:45.992980+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.05436v2","created_at":"2026-07-05T01:22:45.992980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.05436","created_at":"2026-07-05T01:22:45.992980+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQIHQW2PTMBR","created_at":"2026-07-05T01:22:45.992980+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQIHQW2PTMBRDLIS","created_at":"2026-07-05T01:22:45.992980+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQIHQW2P","created_at":"2026-07-05T01:22:45.992980+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/FQIHQW2PTMBRDLISF6PCP6PCJH","json":"https://pith.science/pith/FQIHQW2PTMBRDLISF6PCP6PCJH.json","graph_json":"https://pith.science/api/pith-number/FQIHQW2PTMBRDLISF6PCP6PCJH/graph.json","events_json":"https://pith.science/api/pith-number/FQIHQW2PTMBRDLISF6PCP6PCJH/events.json","paper":"https://pith.science/paper/FQIHQW2P"},"agent_actions":{"view_html":"https://pith.science/pith/FQIHQW2PTMBRDLISF6PCP6PCJH","download_json":"https://pith.science/pith/FQIHQW2PTMBRDLISF6PCP6PCJH.json","view_paper":"https://pith.science/paper/FQIHQW2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.05436&json=true","fetch_graph":"https://pith.science/api/pith-number/FQIHQW2PTMBRDLISF6PCP6PCJH/graph.json","fetch_events":"https://pith.science/api/pith-number/FQIHQW2PTMBRDLISF6PCP6PCJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQIHQW2PTMBRDLISF6PCP6PCJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQIHQW2PTMBRDLISF6PCP6PCJH/action/storage_attestation","attest_author":"https://pith.science/pith/FQIHQW2PTMBRDLISF6PCP6PCJH/action/author_attestation","sign_citation":"https://pith.science/pith/FQIHQW2PTMBRDLISF6PCP6PCJH/action/citation_signature","submit_replication":"https://pith.science/pith/FQIHQW2PTMBRDLISF6PCP6PCJH/action/replication_record"}},"created_at":"2026-07-05T01:22:45.992980+00:00","updated_at":"2026-07-05T01:22:45.992980+00:00"}