{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RJL2O74Q62VHKVBPM6MF3EPDFJ","short_pith_number":"pith:RJL2O74Q","schema_version":"1.0","canonical_sha256":"8a57a77f90f6aa75542f67985d91e32a41d54928a62da740dff88b2f85396d4f","source":{"kind":"arxiv","id":"1706.03149","version":2},"attestation_state":"computed","paper":{"title":"An Expectation-Maximization Algorithm for the Fractal Inverse Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Peter Bloem, Steven de Rooij","submitted_at":"2017-06-09T22:50:32Z","abstract_excerpt":"We present an Expectation-Maximization algorithm for the fractal inverse problem: the problem of fitting a fractal model to data. In our setting the fractals are Iterated Function Systems (IFS), with similitudes as the family of transformations. The data is a point cloud in ${\\mathbb R}^H$ with arbitrary dimension $H$. Each IFS defines a probability distribution on ${\\mathbb R}^H$, so that the fractal inverse problem can be cast as a problem of parameter estimation. We show that the algorithm reconstructs well-known fractals from data, with the model converging to high precision parameters. We"},"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":"1706.03149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-09T22:50:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"529e2df821e56f4732a5d8bf508ebcc5a8a9ece8ec9a1056da39caf44aac2f3a","abstract_canon_sha256":"390716711f24bf80007c85dc7b7677fd014c483ef52d20ed2269c762359a2cd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:12.196732Z","signature_b64":"7FyXQmUbvtiQ/TPZmqD5BAnWLr5ASW8/wYAzy6+sBgEF+qCNHB2mGouuJaWlcWQgOXjt1iixDuhqp5pgB/33CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a57a77f90f6aa75542f67985d91e32a41d54928a62da740dff88b2f85396d4f","last_reissued_at":"2026-05-18T00:41:12.196094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:12.196094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Expectation-Maximization Algorithm for the Fractal Inverse Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Peter Bloem, Steven de Rooij","submitted_at":"2017-06-09T22:50:32Z","abstract_excerpt":"We present an Expectation-Maximization algorithm for the fractal inverse problem: the problem of fitting a fractal model to data. In our setting the fractals are Iterated Function Systems (IFS), with similitudes as the family of transformations. The data is a point cloud in ${\\mathbb R}^H$ with arbitrary dimension $H$. Each IFS defines a probability distribution on ${\\mathbb R}^H$, so that the fractal inverse problem can be cast as a problem of parameter estimation. We show that the algorithm reconstructs well-known fractals from data, with the model converging to high precision parameters. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03149","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":"1706.03149","created_at":"2026-05-18T00:41:12.196198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03149v2","created_at":"2026-05-18T00:41:12.196198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03149","created_at":"2026-05-18T00:41:12.196198+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJL2O74Q62VH","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJL2O74Q62VHKVBP","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJL2O74Q","created_at":"2026-05-18T12:31:39.905425+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/RJL2O74Q62VHKVBPM6MF3EPDFJ","json":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ.json","graph_json":"https://pith.science/api/pith-number/RJL2O74Q62VHKVBPM6MF3EPDFJ/graph.json","events_json":"https://pith.science/api/pith-number/RJL2O74Q62VHKVBPM6MF3EPDFJ/events.json","paper":"https://pith.science/paper/RJL2O74Q"},"agent_actions":{"view_html":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ","download_json":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ.json","view_paper":"https://pith.science/paper/RJL2O74Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03149&json=true","fetch_graph":"https://pith.science/api/pith-number/RJL2O74Q62VHKVBPM6MF3EPDFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RJL2O74Q62VHKVBPM6MF3EPDFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/action/storage_attestation","attest_author":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/action/author_attestation","sign_citation":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/action/citation_signature","submit_replication":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/action/replication_record"}},"created_at":"2026-05-18T00:41:12.196198+00:00","updated_at":"2026-05-18T00:41:12.196198+00:00"}