{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:33IEWHPPMRWBZTTFBIU4X4YANB","short_pith_number":"pith:33IEWHPP","canonical_record":{"source":{"id":"2505.10421","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T15:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"4e52401c50547e8b898b93e02068b93d64b3e8a4365f594e150e65fa0111f690","abstract_canon_sha256":"6dccf0888c5c54206b4d63915824ef38781e391a5916bc2f488351b911bc7900"},"schema_version":"1.0"},"canonical_sha256":"ded04b1def646c1cce650a29cbf3006852ba01a3dd6596f8dda842e1f74643dd","source":{"kind":"arxiv","id":"2505.10421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.10421","created_at":"2026-07-05T11:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"2505.10421v1","created_at":"2026-07-05T11:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10421","created_at":"2026-07-05T11:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"33IEWHPPMRWB","created_at":"2026-07-05T11:03:38Z"},{"alias_kind":"pith_short_16","alias_value":"33IEWHPPMRWBZTTF","created_at":"2026-07-05T11:03:38Z"},{"alias_kind":"pith_short_8","alias_value":"33IEWHPP","created_at":"2026-07-05T11:03:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:33IEWHPPMRWBZTTFBIU4X4YANB","target":"record","payload":{"canonical_record":{"source":{"id":"2505.10421","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T15:38:20Z","cross_cats_sorted":[],"title_canon_sha256":"4e52401c50547e8b898b93e02068b93d64b3e8a4365f594e150e65fa0111f690","abstract_canon_sha256":"6dccf0888c5c54206b4d63915824ef38781e391a5916bc2f488351b911bc7900"},"schema_version":"1.0"},"canonical_sha256":"ded04b1def646c1cce650a29cbf3006852ba01a3dd6596f8dda842e1f74643dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:38.151025Z","signature_b64":"cWgOLFWoIj0HyQEGJsC0h92JRsX7LlOvMpn51RQZuaZn4jFHe7eYddhHkzQlCsHPOQekcn6k/b2cnz0iX+iMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ded04b1def646c1cce650a29cbf3006852ba01a3dd6596f8dda842e1f74643dd","last_reissued_at":"2026-07-05T11:03:38.150584Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:38.150584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.10421","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-07-05T11:03:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WMY8zFkZZSfAT4NfVyyvve1Ple2DBz5bXKtRKC4Slv+YTc7nsy3Bu40zX/+Z0ZWZPgtJyFHZNsAiR13lP35uDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:25:52.153140Z"},"content_sha256":"097f0651723d505b93ecf4f8f30f4bf75fe18fdd782f69588227c6a7d1470274","schema_version":"1.0","event_id":"sha256:097f0651723d505b93ecf4f8f30f4bf75fe18fdd782f69588227c6a7d1470274"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:33IEWHPPMRWBZTTFBIU4X4YANB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A 140 line MATLAB code for topology optimization problems with probabilistic parameters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrian Uihlein, Michael Stingl, Ole Sigmund","submitted_at":"2025-05-15T15:38:20Z","abstract_excerpt":"We present an efficient 140 line MATLAB code for topology optimization problems that include probabilistic parameters. It is built from the top99neo code by Ferrari and Sigmund and incorporates a stochastic sample-based approach. Old gradient samples are adaptively recombined during the optimization process to obtain a gradient approximation with vanishing approximation error. The method's performance is thoroughly analyzed for several numerical examples. While we focus on applications in which stochastic parameters describe local material failure, we also present extensions of the code to oth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10421","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.10421/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"},"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-07-05T11:03:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6B9X6DXwoynA3Rsqq5BVHpy4ssnaxrQAMQGF98UC4K8mtjhqjyiL+l2le3Xn1kCv1SkMsb+nL19BRc6hxjnWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:25:52.153611Z"},"content_sha256":"2fb19cc15f046cf199c84c2c7b59c8dec1574469790f51c3247514b29e3ed76c","schema_version":"1.0","event_id":"sha256:2fb19cc15f046cf199c84c2c7b59c8dec1574469790f51c3247514b29e3ed76c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33IEWHPPMRWBZTTFBIU4X4YANB/bundle.json","state_url":"https://pith.science/pith/33IEWHPPMRWBZTTFBIU4X4YANB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33IEWHPPMRWBZTTFBIU4X4YANB/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-08-04T01:25:52Z","links":{"resolver":"https://pith.science/pith/33IEWHPPMRWBZTTFBIU4X4YANB","bundle":"https://pith.science/pith/33IEWHPPMRWBZTTFBIU4X4YANB/bundle.json","state":"https://pith.science/pith/33IEWHPPMRWBZTTFBIU4X4YANB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33IEWHPPMRWBZTTFBIU4X4YANB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:33IEWHPPMRWBZTTFBIU4X4YANB","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":"6dccf0888c5c54206b4d63915824ef38781e391a5916bc2f488351b911bc7900","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T15:38:20Z","title_canon_sha256":"4e52401c50547e8b898b93e02068b93d64b3e8a4365f594e150e65fa0111f690"},"schema_version":"1.0","source":{"id":"2505.10421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.10421","created_at":"2026-07-05T11:03:38Z"},{"alias_kind":"arxiv_version","alias_value":"2505.10421v1","created_at":"2026-07-05T11:03:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10421","created_at":"2026-07-05T11:03:38Z"},{"alias_kind":"pith_short_12","alias_value":"33IEWHPPMRWB","created_at":"2026-07-05T11:03:38Z"},{"alias_kind":"pith_short_16","alias_value":"33IEWHPPMRWBZTTF","created_at":"2026-07-05T11:03:38Z"},{"alias_kind":"pith_short_8","alias_value":"33IEWHPP","created_at":"2026-07-05T11:03:38Z"}],"graph_snapshots":[{"event_id":"sha256:2fb19cc15f046cf199c84c2c7b59c8dec1574469790f51c3247514b29e3ed76c","target":"graph","created_at":"2026-07-05T11:03:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.10421/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an efficient 140 line MATLAB code for topology optimization problems that include probabilistic parameters. It is built from the top99neo code by Ferrari and Sigmund and incorporates a stochastic sample-based approach. Old gradient samples are adaptively recombined during the optimization process to obtain a gradient approximation with vanishing approximation error. The method's performance is thoroughly analyzed for several numerical examples. While we focus on applications in which stochastic parameters describe local material failure, we also present extensions of the code to oth","authors_text":"Andrian Uihlein, Michael Stingl, Ole Sigmund","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T15:38:20Z","title":"A 140 line MATLAB code for topology optimization problems with probabilistic parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10421","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:097f0651723d505b93ecf4f8f30f4bf75fe18fdd782f69588227c6a7d1470274","target":"record","created_at":"2026-07-05T11:03:38Z","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":"6dccf0888c5c54206b4d63915824ef38781e391a5916bc2f488351b911bc7900","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T15:38:20Z","title_canon_sha256":"4e52401c50547e8b898b93e02068b93d64b3e8a4365f594e150e65fa0111f690"},"schema_version":"1.0","source":{"id":"2505.10421","kind":"arxiv","version":1}},"canonical_sha256":"ded04b1def646c1cce650a29cbf3006852ba01a3dd6596f8dda842e1f74643dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ded04b1def646c1cce650a29cbf3006852ba01a3dd6596f8dda842e1f74643dd","first_computed_at":"2026-07-05T11:03:38.150584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:03:38.150584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cWgOLFWoIj0HyQEGJsC0h92JRsX7LlOvMpn51RQZuaZn4jFHe7eYddhHkzQlCsHPOQekcn6k/b2cnz0iX+iMCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:03:38.151025Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.10421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:097f0651723d505b93ecf4f8f30f4bf75fe18fdd782f69588227c6a7d1470274","sha256:2fb19cc15f046cf199c84c2c7b59c8dec1574469790f51c3247514b29e3ed76c"],"state_sha256":"ceecf15d7e9abcd3ddbd6bba35fd3a7096386e01c07e3d1234617da4c5fa0108"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pI937+9W+G9e9bRARcCZlkotWww1szIlcG8U82/X9hNMFdH9pNLs1+wIJeeBirDJUk8eQ3UG+vp/ZNA6fEPrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T01:25:52.158667Z","bundle_sha256":"0ab9dccc731c6174754f612ea0d10ff6781d3f8753b941b6c631f29e390b0f6d"}}