{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:J6TFREQEQE7KKEMGIJ5GZO6GHE","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":"b63f99b56aa6459ca1efa30a321ce9dd14819b09b1a5fe411e9fee6c6c9ae9ee","cross_cats_sorted":[],"license":"","primary_cat":"cs.NE","submitted_at":"2007-10-03T18:29:12Z","title_canon_sha256":"b9293c8722b348766b2b99631573f1e6093791baa76c7bbd4820c6cf74e832cd"},"schema_version":"1.0","source":{"id":"0710.0672","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.0672","created_at":"2026-05-18T04:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"0710.0672v2","created_at":"2026-05-18T04:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.0672","created_at":"2026-05-18T04:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"J6TFREQEQE7K","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"J6TFREQEQE7KKEMG","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"J6TFREQE","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:0472f404d225ca374f48fe81455849720b63f350b77cf641fd9c74652fecdb07","target":"graph","created_at":"2026-05-18T04:27:02Z","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":"The field of algorithmic self-assembly is concerned with the design and analysis of self-assembly systems from a computational perspective, that is, from the perspective of mathematical problems whose study may give insight into the natural processes through which elementary objects self-assemble into more complex ones. One of the main problems of algorithmic self-assembly is the minimum tile set problem (MTSP), which asks for a collection of types of elementary objects (called tiles) to be found for the self-assembly of an object having a pre-established shape. Such a collection is to be as c","authors_text":"Fabio R. J. Vieira, Valmir C. Barbosa","cross_cats":[],"headline":"","license":"","primary_cat":"cs.NE","submitted_at":"2007-10-03T18:29:12Z","title":"Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.0672","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:c03a218dd0a4d8886af67a9f975dec1d7cd87dd420407329ece60bcd6e8acc9a","target":"record","created_at":"2026-05-18T04:27:02Z","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":"b63f99b56aa6459ca1efa30a321ce9dd14819b09b1a5fe411e9fee6c6c9ae9ee","cross_cats_sorted":[],"license":"","primary_cat":"cs.NE","submitted_at":"2007-10-03T18:29:12Z","title_canon_sha256":"b9293c8722b348766b2b99631573f1e6093791baa76c7bbd4820c6cf74e832cd"},"schema_version":"1.0","source":{"id":"0710.0672","kind":"arxiv","version":2}},"canonical_sha256":"4fa6589204813ea51186427a6cbbc63937438c850d2b6fac36adb14804eb41d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fa6589204813ea51186427a6cbbc63937438c850d2b6fac36adb14804eb41d5","first_computed_at":"2026-05-18T04:27:02.861488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:02.861488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RmluKxFvqo67l8qQWBdqargwO3Du92FuTIKcbl8LKxbJZF9rXuWBG0pNDHPcvUnN1Po1d68ZmZNKIJWy8hXsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:02.862098Z","signed_message":"canonical_sha256_bytes"},"source_id":"0710.0672","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c03a218dd0a4d8886af67a9f975dec1d7cd87dd420407329ece60bcd6e8acc9a","sha256:0472f404d225ca374f48fe81455849720b63f350b77cf641fd9c74652fecdb07"],"state_sha256":"8c81b0825389dc30e5bd4a5e2e43eb205f86964172940a6ee69dd71c9e51c3c6"}