{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RJL2O74Q62VHKVBPM6MF3EPDFJ","short_pith_number":"pith:RJL2O74Q","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"},"canonical_sha256":"8a57a77f90f6aa75542f67985d91e32a41d54928a62da740dff88b2f85396d4f","source":{"kind":"arxiv","id":"1706.03149","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03149","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03149v2","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03149","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"RJL2O74Q62VH","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJL2O74Q62VHKVBP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJL2O74Q","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RJL2O74Q62VHKVBPM6MF3EPDFJ","target":"record","payload":{"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"},"canonical_sha256":"8a57a77f90f6aa75542f67985d91e32a41d54928a62da740dff88b2f85396d4f","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"},"source_kind":"arxiv","source_id":"1706.03149","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-18T00:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YS18N8E9kBGYGlElDlV0O5BIxa7F6WYjD13l7GRfMxgcbbaMBe10a91fpf/H5ezuPlFfpYg7zZl563sn1olQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:33:49.046031Z"},"content_sha256":"16e0a726c6f2b4c9c534a71de9b60b0e95c63bffbe2f01a309adeabe52b63fbf","schema_version":"1.0","event_id":"sha256:16e0a726c6f2b4c9c534a71de9b60b0e95c63bffbe2f01a309adeabe52b63fbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RJL2O74Q62VHKVBPM6MF3EPDFJ","target":"graph","payload":{"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"},"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-18T00:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyfh6Kr2nmOuL+8vGYpHorIYIMNWR2Thra5CfPrqwn/T6cWs9W9VfINvarj1IpP7DIQr7A2rJRqOs9MD9S+5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:33:49.046396Z"},"content_sha256":"8246bbde12bfde1c19036f9fc2b9331b7f849e11ce2878ec7a258869518c6857","schema_version":"1.0","event_id":"sha256:8246bbde12bfde1c19036f9fc2b9331b7f849e11ce2878ec7a258869518c6857"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/bundle.json","state_url":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/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-05-26T03:33:49Z","links":{"resolver":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ","bundle":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/bundle.json","state":"https://pith.science/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJL2O74Q62VHKVBPM6MF3EPDFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RJL2O74Q62VHKVBPM6MF3EPDFJ","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":"390716711f24bf80007c85dc7b7677fd014c483ef52d20ed2269c762359a2cd9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-09T22:50:32Z","title_canon_sha256":"529e2df821e56f4732a5d8bf508ebcc5a8a9ece8ec9a1056da39caf44aac2f3a"},"schema_version":"1.0","source":{"id":"1706.03149","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03149","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03149v2","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03149","created_at":"2026-05-18T00:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"RJL2O74Q62VH","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RJL2O74Q62VHKVBP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RJL2O74Q","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:8246bbde12bfde1c19036f9fc2b9331b7f849e11ce2878ec7a258869518c6857","target":"graph","created_at":"2026-05-18T00:41:12Z","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 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","authors_text":"Peter Bloem, Steven de Rooij","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-09T22:50:32Z","title":"An Expectation-Maximization Algorithm for the Fractal Inverse Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03149","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:16e0a726c6f2b4c9c534a71de9b60b0e95c63bffbe2f01a309adeabe52b63fbf","target":"record","created_at":"2026-05-18T00:41:12Z","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":"390716711f24bf80007c85dc7b7677fd014c483ef52d20ed2269c762359a2cd9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-09T22:50:32Z","title_canon_sha256":"529e2df821e56f4732a5d8bf508ebcc5a8a9ece8ec9a1056da39caf44aac2f3a"},"schema_version":"1.0","source":{"id":"1706.03149","kind":"arxiv","version":2}},"canonical_sha256":"8a57a77f90f6aa75542f67985d91e32a41d54928a62da740dff88b2f85396d4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a57a77f90f6aa75542f67985d91e32a41d54928a62da740dff88b2f85396d4f","first_computed_at":"2026-05-18T00:41:12.196094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:12.196094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7FyXQmUbvtiQ/TPZmqD5BAnWLr5ASW8/wYAzy6+sBgEF+qCNHB2mGouuJaWlcWQgOXjt1iixDuhqp5pgB/33CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:12.196732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03149","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16e0a726c6f2b4c9c534a71de9b60b0e95c63bffbe2f01a309adeabe52b63fbf","sha256:8246bbde12bfde1c19036f9fc2b9331b7f849e11ce2878ec7a258869518c6857"],"state_sha256":"4be5cba07584e9e8c8407f9c77c4b301fa72945f04a597c4b7444256bc6ba470"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"85xkxJWfazJlXQcP48DRL9u9lOklqCDwGLC1ZTv26XV279PIBNU7uKSFVirytCzv9CONzkZ9LJFgR90OVeuODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:33:49.048976Z","bundle_sha256":"ebd483604d3abd002650d5222afd7cbe2142ee30e77d50511901c9b60d4f6703"}}