{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DVSMOALRDN2BUVK2LQZZQDQZDI","short_pith_number":"pith:DVSMOALR","schema_version":"1.0","canonical_sha256":"1d64c701711b741a555a5c33980e191a235c2e5ad56c907ef8d8d6fc61635809","source":{"kind":"arxiv","id":"1303.1456","version":1},"attestation_state":"computed","paper":{"title":"A Probabilistic Algorithm for Calculating Structure: Borrowing from Simulated Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Russ B. Altman","submitted_at":"2013-03-06T14:18:35Z","abstract_excerpt":"We have developed a general Bayesian algorithm for determining the coordinates of points in a three-dimensional space.  The algorithm takes as input a set of probabilistic constraints on the coordinates of the points, and an a priori distribution for each point location.  The output is a maximum-likelihood estimate of the location of each point.  We use the extended, iterated Kalman filter, and add a search heuristic for optimizing its solution under nonlinear conditions.  This heuristic is based on the same principle as the simulated annealing heuristic for other optimization problems.  Our m"},"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":"1303.1456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"91c6aff80675fac1bbdf2be631e06f86f738acbbd5be874fcc91cf7ce501a6d8","abstract_canon_sha256":"1cd08ead0a5a15b61e549100a97f6d795a72d21826a1d245b59db25b895f020f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:42.857274Z","signature_b64":"8Z5cdZ4Nh7E9AxVPvQn2mBYIiowaht2B+ir2sw89tHLcV9GxMaYfHPRV6OVnrOoqiZFM7KF2F5hQWM/tyCS7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d64c701711b741a555a5c33980e191a235c2e5ad56c907ef8d8d6fc61635809","last_reissued_at":"2026-05-18T03:31:42.856526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:42.856526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Probabilistic Algorithm for Calculating Structure: Borrowing from Simulated Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Russ B. Altman","submitted_at":"2013-03-06T14:18:35Z","abstract_excerpt":"We have developed a general Bayesian algorithm for determining the coordinates of points in a three-dimensional space.  The algorithm takes as input a set of probabilistic constraints on the coordinates of the points, and an a priori distribution for each point location.  The output is a maximum-likelihood estimate of the location of each point.  We use the extended, iterated Kalman filter, and add a search heuristic for optimizing its solution under nonlinear conditions.  This heuristic is based on the same principle as the simulated annealing heuristic for other optimization problems.  Our m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1456","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":""},"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":"1303.1456","created_at":"2026-05-18T03:31:42.856630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1456v1","created_at":"2026-05-18T03:31:42.856630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1456","created_at":"2026-05-18T03:31:42.856630+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVSMOALRDN2B","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVSMOALRDN2BUVK2","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVSMOALR","created_at":"2026-05-18T12:27:43.054852+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/DVSMOALRDN2BUVK2LQZZQDQZDI","json":"https://pith.science/pith/DVSMOALRDN2BUVK2LQZZQDQZDI.json","graph_json":"https://pith.science/api/pith-number/DVSMOALRDN2BUVK2LQZZQDQZDI/graph.json","events_json":"https://pith.science/api/pith-number/DVSMOALRDN2BUVK2LQZZQDQZDI/events.json","paper":"https://pith.science/paper/DVSMOALR"},"agent_actions":{"view_html":"https://pith.science/pith/DVSMOALRDN2BUVK2LQZZQDQZDI","download_json":"https://pith.science/pith/DVSMOALRDN2BUVK2LQZZQDQZDI.json","view_paper":"https://pith.science/paper/DVSMOALR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1456&json=true","fetch_graph":"https://pith.science/api/pith-number/DVSMOALRDN2BUVK2LQZZQDQZDI/graph.json","fetch_events":"https://pith.science/api/pith-number/DVSMOALRDN2BUVK2LQZZQDQZDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVSMOALRDN2BUVK2LQZZQDQZDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVSMOALRDN2BUVK2LQZZQDQZDI/action/storage_attestation","attest_author":"https://pith.science/pith/DVSMOALRDN2BUVK2LQZZQDQZDI/action/author_attestation","sign_citation":"https://pith.science/pith/DVSMOALRDN2BUVK2LQZZQDQZDI/action/citation_signature","submit_replication":"https://pith.science/pith/DVSMOALRDN2BUVK2LQZZQDQZDI/action/replication_record"}},"created_at":"2026-05-18T03:31:42.856630+00:00","updated_at":"2026-05-18T03:31:42.856630+00:00"}