{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZTOX7RVMUZ7TNOFNA46DRZW2PA","short_pith_number":"pith:ZTOX7RVM","canonical_record":{"source":{"id":"1907.01117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T01:11:49Z","cross_cats_sorted":["cs.CE","cs.RO"],"title_canon_sha256":"78dc3592186d4376ea89dc381ddc35a22459636b2b430c63316e5621181d6022","abstract_canon_sha256":"b8bf75b595a189d2cc687aa53b810441e4debec4d5d204f52bf0495c610ef66b"},"schema_version":"1.0"},"canonical_sha256":"ccdd7fc6aca67f36b8ad073c38e6da782a8c579eb2601285c482f26614a6c070","source":{"kind":"arxiv","id":"1907.01117","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01117","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01117v2","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01117","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZTOX7RVMUZ7T","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZTOX7RVMUZ7TNOFN","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZTOX7RVM","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZTOX7RVMUZ7TNOFNA46DRZW2PA","target":"record","payload":{"canonical_record":{"source":{"id":"1907.01117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T01:11:49Z","cross_cats_sorted":["cs.CE","cs.RO"],"title_canon_sha256":"78dc3592186d4376ea89dc381ddc35a22459636b2b430c63316e5621181d6022","abstract_canon_sha256":"b8bf75b595a189d2cc687aa53b810441e4debec4d5d204f52bf0495c610ef66b"},"schema_version":"1.0"},"canonical_sha256":"ccdd7fc6aca67f36b8ad073c38e6da782a8c579eb2601285c482f26614a6c070","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:00.540359Z","signature_b64":"8eAGxrMzmu1J/2b87u28tJeB/MUa/6Lg5lES1x5z1QD72Y5O3HOaxYj0LcsvPclHPVQ9EbdZyAa0cu4Whne+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccdd7fc6aca67f36b8ad073c38e6da782a8c579eb2601285c482f26614a6c070","last_reissued_at":"2026-05-17T23:41:00.539714Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:00.539714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.01117","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-17T23:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZGf6Bsbq5/su3StCZxrei2Z0gCD+KWaLtexbs+8dnOTyNS46PPuoM+JLz3x4xfweR0Z0Nh2AlAOjWSagIgbeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:51:33.807965Z"},"content_sha256":"8efbdf00e90e7893442c1d94573d553c0d908e9963efc2a5cebd17ddebeca4ec","schema_version":"1.0","event_id":"sha256:8efbdf00e90e7893442c1d94573d553c0d908e9963efc2a5cebd17ddebeca4ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZTOX7RVMUZ7TNOFNA46DRZW2PA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring Feasible Design Spaces for Heterogeneous Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.RO"],"primary_cat":"cs.CG","authors_text":"Amir M. Mirzendehdel, Morad Behandish, Saigopal Nelaturi","submitted_at":"2019-07-02T01:11:49Z","abstract_excerpt":"We demonstrate an approach of exploring design spaces to simultaneously satisfy kinematics- and physics-based requirements. We present a classification of constraints and solvers to enable postponing optimization as far down the design workflow as possible. The solvers are organized into two broad classes of design space 'pruning' and 'exploration' by considering the types of constraints they can satisfy. We show that pointwise constraints define feasible design subspaces that can be represented and computed as first-class entities by their maximal feasible elements. The design space is pruned"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01117","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-17T23:41:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+UOkp+s7qrsOZiUcmJ8VQYyMSiZw/zb4huwV28RZjPSoDsp7WPjuOqxKVZ1hLxzxt3IH6UcYaGQ9lzcdJ0o2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:51:33.808361Z"},"content_sha256":"3898040b19d633f866dd959b0dde54cbbcd23f7c198723060a05ed543b718998","schema_version":"1.0","event_id":"sha256:3898040b19d633f866dd959b0dde54cbbcd23f7c198723060a05ed543b718998"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTOX7RVMUZ7TNOFNA46DRZW2PA/bundle.json","state_url":"https://pith.science/pith/ZTOX7RVMUZ7TNOFNA46DRZW2PA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTOX7RVMUZ7TNOFNA46DRZW2PA/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-11T10:51:33Z","links":{"resolver":"https://pith.science/pith/ZTOX7RVMUZ7TNOFNA46DRZW2PA","bundle":"https://pith.science/pith/ZTOX7RVMUZ7TNOFNA46DRZW2PA/bundle.json","state":"https://pith.science/pith/ZTOX7RVMUZ7TNOFNA46DRZW2PA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTOX7RVMUZ7TNOFNA46DRZW2PA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZTOX7RVMUZ7TNOFNA46DRZW2PA","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":"b8bf75b595a189d2cc687aa53b810441e4debec4d5d204f52bf0495c610ef66b","cross_cats_sorted":["cs.CE","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T01:11:49Z","title_canon_sha256":"78dc3592186d4376ea89dc381ddc35a22459636b2b430c63316e5621181d6022"},"schema_version":"1.0","source":{"id":"1907.01117","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.01117","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"arxiv_version","alias_value":"1907.01117v2","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01117","created_at":"2026-05-17T23:41:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZTOX7RVMUZ7T","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZTOX7RVMUZ7TNOFN","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZTOX7RVM","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:3898040b19d633f866dd959b0dde54cbbcd23f7c198723060a05ed543b718998","target":"graph","created_at":"2026-05-17T23:41:00Z","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":"We demonstrate an approach of exploring design spaces to simultaneously satisfy kinematics- and physics-based requirements. We present a classification of constraints and solvers to enable postponing optimization as far down the design workflow as possible. The solvers are organized into two broad classes of design space 'pruning' and 'exploration' by considering the types of constraints they can satisfy. We show that pointwise constraints define feasible design subspaces that can be represented and computed as first-class entities by their maximal feasible elements. The design space is pruned","authors_text":"Amir M. Mirzendehdel, Morad Behandish, Saigopal Nelaturi","cross_cats":["cs.CE","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T01:11:49Z","title":"Exploring Feasible Design Spaces for Heterogeneous Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01117","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:8efbdf00e90e7893442c1d94573d553c0d908e9963efc2a5cebd17ddebeca4ec","target":"record","created_at":"2026-05-17T23:41:00Z","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":"b8bf75b595a189d2cc687aa53b810441e4debec4d5d204f52bf0495c610ef66b","cross_cats_sorted":["cs.CE","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-07-02T01:11:49Z","title_canon_sha256":"78dc3592186d4376ea89dc381ddc35a22459636b2b430c63316e5621181d6022"},"schema_version":"1.0","source":{"id":"1907.01117","kind":"arxiv","version":2}},"canonical_sha256":"ccdd7fc6aca67f36b8ad073c38e6da782a8c579eb2601285c482f26614a6c070","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccdd7fc6aca67f36b8ad073c38e6da782a8c579eb2601285c482f26614a6c070","first_computed_at":"2026-05-17T23:41:00.539714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:00.539714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8eAGxrMzmu1J/2b87u28tJeB/MUa/6Lg5lES1x5z1QD72Y5O3HOaxYj0LcsvPclHPVQ9EbdZyAa0cu4Whne+Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:00.540359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.01117","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8efbdf00e90e7893442c1d94573d553c0d908e9963efc2a5cebd17ddebeca4ec","sha256:3898040b19d633f866dd959b0dde54cbbcd23f7c198723060a05ed543b718998"],"state_sha256":"6751d6d2e2902dda28389162cda137a6372ce1809729f8d1ac3a38fc58f1fa57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXtUkybdqXA+iNIAD8w9IiQy+9XWGYBnnfHhoOYAvzfiTA0+VnoYkvIVObaypfJyvo+I4mmOArvGbysF0DieCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:51:33.810411Z","bundle_sha256":"eadbac9eaff3a5ddceb706e48a576f93f2b4b525434765da7f5eec31e5e3aaa9"}}