{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q6REP4EQSRNOMKGW7AREID6725","short_pith_number":"pith:Q6REP4EQ","schema_version":"1.0","canonical_sha256":"87a247f090945ae628d6f822440fdfd7594fb8ed612a6f064bb2bdf9372bf925","source":{"kind":"arxiv","id":"1702.01574","version":2},"attestation_state":"computed","paper":{"title":"Data Driven Computing with Noisy Material Data Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.comp-ph","authors_text":"Michael Ortiz, Trenton Kirchdoerfer","submitted_at":"2017-02-06T11:36:32Z","abstract_excerpt":"We formulate a Data Driven Computing paradigm, termed max-ent Data Driven Computing, that generalizes distance-minimizing Data Driven Computing and is robust with respect to outliers. Robustness is achieved by means of clustering analysis. Specifically, we assign data points a variable relevance depending on distance to the solution and on maximum-entropy estimation. The resulting scheme consists of the minimization of a suitably-defined free energy over phase space subject to compatibility and equilibrium constraints. Distance-minimizing Data Driven schemes are recovered in the limit of zero "},"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":"1702.01574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2017-02-06T11:36:32Z","cross_cats_sorted":[],"title_canon_sha256":"17e313191653d2352d5741e78123849c53c21c833605b59bcb369a227c44e5fc","abstract_canon_sha256":"cb5eb51a7530321e9714ca653e8b387e3634a416cd593ec61156b854f8bb24fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:05.708465Z","signature_b64":"plBuKN+qgP3+61IWVrDIAV8CP813fYbYVG7tyNUTm0n0NU/3quHZIKvyoWDDpUHrn5zjXwjMkabEF5cyisckAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87a247f090945ae628d6f822440fdfd7594fb8ed612a6f064bb2bdf9372bf925","last_reissued_at":"2026-05-18T00:30:05.707875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:05.707875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Driven Computing with Noisy Material Data Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.comp-ph","authors_text":"Michael Ortiz, Trenton Kirchdoerfer","submitted_at":"2017-02-06T11:36:32Z","abstract_excerpt":"We formulate a Data Driven Computing paradigm, termed max-ent Data Driven Computing, that generalizes distance-minimizing Data Driven Computing and is robust with respect to outliers. Robustness is achieved by means of clustering analysis. Specifically, we assign data points a variable relevance depending on distance to the solution and on maximum-entropy estimation. The resulting scheme consists of the minimization of a suitably-defined free energy over phase space subject to compatibility and equilibrium constraints. Distance-minimizing Data Driven schemes are recovered in the limit of zero "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01574","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":"1702.01574","created_at":"2026-05-18T00:30:05.707955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01574v2","created_at":"2026-05-18T00:30:05.707955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01574","created_at":"2026-05-18T00:30:05.707955+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6REP4EQSRNO","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6REP4EQSRNOMKGW","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6REP4EQ","created_at":"2026-05-18T12:31:37.085036+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/Q6REP4EQSRNOMKGW7AREID6725","json":"https://pith.science/pith/Q6REP4EQSRNOMKGW7AREID6725.json","graph_json":"https://pith.science/api/pith-number/Q6REP4EQSRNOMKGW7AREID6725/graph.json","events_json":"https://pith.science/api/pith-number/Q6REP4EQSRNOMKGW7AREID6725/events.json","paper":"https://pith.science/paper/Q6REP4EQ"},"agent_actions":{"view_html":"https://pith.science/pith/Q6REP4EQSRNOMKGW7AREID6725","download_json":"https://pith.science/pith/Q6REP4EQSRNOMKGW7AREID6725.json","view_paper":"https://pith.science/paper/Q6REP4EQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01574&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6REP4EQSRNOMKGW7AREID6725/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6REP4EQSRNOMKGW7AREID6725/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6REP4EQSRNOMKGW7AREID6725/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6REP4EQSRNOMKGW7AREID6725/action/storage_attestation","attest_author":"https://pith.science/pith/Q6REP4EQSRNOMKGW7AREID6725/action/author_attestation","sign_citation":"https://pith.science/pith/Q6REP4EQSRNOMKGW7AREID6725/action/citation_signature","submit_replication":"https://pith.science/pith/Q6REP4EQSRNOMKGW7AREID6725/action/replication_record"}},"created_at":"2026-05-18T00:30:05.707955+00:00","updated_at":"2026-05-18T00:30:05.707955+00:00"}