{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:J6TFREQEQE7KKEMGIJ5GZO6GHE","short_pith_number":"pith:J6TFREQE","schema_version":"1.0","canonical_sha256":"4fa6589204813ea51186427a6cbbc63937438c850d2b6fac36adb14804eb41d5","source":{"kind":"arxiv","id":"0710.0672","version":2},"attestation_state":"computed","paper":{"title":"Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Fabio R. J. Vieira, Valmir C. Barbosa","submitted_at":"2007-10-03T18:29:12Z","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"},"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":"0710.0672","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.NE","submitted_at":"2007-10-03T18:29:12Z","cross_cats_sorted":[],"title_canon_sha256":"b9293c8722b348766b2b99631573f1e6093791baa76c7bbd4820c6cf74e832cd","abstract_canon_sha256":"b63f99b56aa6459ca1efa30a321ce9dd14819b09b1a5fe411e9fee6c6c9ae9ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:02.862098Z","signature_b64":"RmluKxFvqo67l8qQWBdqargwO3Du92FuTIKcbl8LKxbJZF9rXuWBG0pNDHPcvUnN1Po1d68ZmZNKIJWy8hXsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fa6589204813ea51186427a6cbbc63937438c850d2b6fac36adb14804eb41d5","last_reissued_at":"2026-05-18T04:27:02.861488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:02.861488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Fabio R. J. Vieira, Valmir C. Barbosa","submitted_at":"2007-10-03T18:29:12Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.0672","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":"0710.0672","created_at":"2026-05-18T04:27:02.861571+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.0672v2","created_at":"2026-05-18T04:27:02.861571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.0672","created_at":"2026-05-18T04:27:02.861571+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6TFREQEQE7K","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6TFREQEQE7KKEMG","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6TFREQE","created_at":"2026-05-18T12:25:55.427421+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/J6TFREQEQE7KKEMGIJ5GZO6GHE","json":"https://pith.science/pith/J6TFREQEQE7KKEMGIJ5GZO6GHE.json","graph_json":"https://pith.science/api/pith-number/J6TFREQEQE7KKEMGIJ5GZO6GHE/graph.json","events_json":"https://pith.science/api/pith-number/J6TFREQEQE7KKEMGIJ5GZO6GHE/events.json","paper":"https://pith.science/paper/J6TFREQE"},"agent_actions":{"view_html":"https://pith.science/pith/J6TFREQEQE7KKEMGIJ5GZO6GHE","download_json":"https://pith.science/pith/J6TFREQEQE7KKEMGIJ5GZO6GHE.json","view_paper":"https://pith.science/paper/J6TFREQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.0672&json=true","fetch_graph":"https://pith.science/api/pith-number/J6TFREQEQE7KKEMGIJ5GZO6GHE/graph.json","fetch_events":"https://pith.science/api/pith-number/J6TFREQEQE7KKEMGIJ5GZO6GHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6TFREQEQE7KKEMGIJ5GZO6GHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6TFREQEQE7KKEMGIJ5GZO6GHE/action/storage_attestation","attest_author":"https://pith.science/pith/J6TFREQEQE7KKEMGIJ5GZO6GHE/action/author_attestation","sign_citation":"https://pith.science/pith/J6TFREQEQE7KKEMGIJ5GZO6GHE/action/citation_signature","submit_replication":"https://pith.science/pith/J6TFREQEQE7KKEMGIJ5GZO6GHE/action/replication_record"}},"created_at":"2026-05-18T04:27:02.861571+00:00","updated_at":"2026-05-18T04:27:02.861571+00:00"}