{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:S2BHKMGWTZ2MRM4BHBAGYELTQ3","short_pith_number":"pith:S2BHKMGW","schema_version":"1.0","canonical_sha256":"96827530d69e74c8b38138406c117386c1c7ab4cdf17718d958ab4ff7f055aa6","source":{"kind":"arxiv","id":"1104.5226","version":2},"attestation_state":"computed","paper":{"title":"Parallelism and Time in Hierarchical Self-Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","q-bio.MN"],"primary_cat":"cs.CC","authors_text":"David Doty, Ho-Lin Chen","submitted_at":"2011-04-27T19:56:01Z","abstract_excerpt":"We study the role that parallelism plays in time complexity of Winfree's abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the \"hierarchical\" aTAM, two assemblies, both consisting of multiple tiles, are allowed to aggregate together, whereas in the \"seeded\" aTAM, tiles attach one at a time to a growing assembly. Adleman, Cheng, Goel, and Huang (\"Running Time and Program Size for Self-Assembled Squares\", STOC 2001) showed how to assemble an n x n square in O(n) time in the seeded aTAM using O(log n / log log n) unique tile types, where both of these paramet"},"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":"1104.5226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-27T19:56:01Z","cross_cats_sorted":["cs.DS","q-bio.MN"],"title_canon_sha256":"c75194ce1e6a4be81e957da1ad5a2dc7bf3c010d92761ec0778da27b77f5c6d7","abstract_canon_sha256":"a5f94b0cfd7115a157a2c218ae3de1cdd251a8f1787019e2c3b8f5351711f3dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:58.234067Z","signature_b64":"5AfRMcHG53wOqEpEDn0IvFIOCtN55bnPzJU2/Udnpo1dsM3IDmujwnoMSJ6fynd76N0/No7dEOLFlZ9lyM4JDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96827530d69e74c8b38138406c117386c1c7ab4cdf17718d958ab4ff7f055aa6","last_reissued_at":"2026-05-18T00:50:58.233621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:58.233621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallelism and Time in Hierarchical Self-Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","q-bio.MN"],"primary_cat":"cs.CC","authors_text":"David Doty, Ho-Lin Chen","submitted_at":"2011-04-27T19:56:01Z","abstract_excerpt":"We study the role that parallelism plays in time complexity of Winfree's abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the \"hierarchical\" aTAM, two assemblies, both consisting of multiple tiles, are allowed to aggregate together, whereas in the \"seeded\" aTAM, tiles attach one at a time to a growing assembly. Adleman, Cheng, Goel, and Huang (\"Running Time and Program Size for Self-Assembled Squares\", STOC 2001) showed how to assemble an n x n square in O(n) time in the seeded aTAM using O(log n / log log n) unique tile types, where both of these paramet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5226","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":"1104.5226","created_at":"2026-05-18T00:50:58.233693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5226v2","created_at":"2026-05-18T00:50:58.233693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5226","created_at":"2026-05-18T00:50:58.233693+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2BHKMGWTZ2M","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2BHKMGWTZ2MRM4B","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2BHKMGW","created_at":"2026-05-18T12:26:41.206345+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/S2BHKMGWTZ2MRM4BHBAGYELTQ3","json":"https://pith.science/pith/S2BHKMGWTZ2MRM4BHBAGYELTQ3.json","graph_json":"https://pith.science/api/pith-number/S2BHKMGWTZ2MRM4BHBAGYELTQ3/graph.json","events_json":"https://pith.science/api/pith-number/S2BHKMGWTZ2MRM4BHBAGYELTQ3/events.json","paper":"https://pith.science/paper/S2BHKMGW"},"agent_actions":{"view_html":"https://pith.science/pith/S2BHKMGWTZ2MRM4BHBAGYELTQ3","download_json":"https://pith.science/pith/S2BHKMGWTZ2MRM4BHBAGYELTQ3.json","view_paper":"https://pith.science/paper/S2BHKMGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5226&json=true","fetch_graph":"https://pith.science/api/pith-number/S2BHKMGWTZ2MRM4BHBAGYELTQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/S2BHKMGWTZ2MRM4BHBAGYELTQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2BHKMGWTZ2MRM4BHBAGYELTQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2BHKMGWTZ2MRM4BHBAGYELTQ3/action/storage_attestation","attest_author":"https://pith.science/pith/S2BHKMGWTZ2MRM4BHBAGYELTQ3/action/author_attestation","sign_citation":"https://pith.science/pith/S2BHKMGWTZ2MRM4BHBAGYELTQ3/action/citation_signature","submit_replication":"https://pith.science/pith/S2BHKMGWTZ2MRM4BHBAGYELTQ3/action/replication_record"}},"created_at":"2026-05-18T00:50:58.233693+00:00","updated_at":"2026-05-18T00:50:58.233693+00:00"}