{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LZUYF72JM5XXACGBYME77CLYUF","short_pith_number":"pith:LZUYF72J","schema_version":"1.0","canonical_sha256":"5e6982ff49676f7008c1c309ff8978a1693e8df8e99c1523c91e978ae9fde376","source":{"kind":"arxiv","id":"1303.2416","version":2},"attestation_state":"computed","paper":{"title":"Fast Arithmetic in Algorithmic Self-Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.DS","authors_text":"Alexandra Keenan, Michael Sherman, Robert Schweller, Xingsi Zhong","submitted_at":"2013-03-11T03:09:38Z","abstract_excerpt":"In this paper we consider the time complexity of computing the sum and product of two $n$-bit numbers within the tile self-assembly model. The (abstract) tile assembly model is a mathematical model of self-assembly in which system components are square tiles with different glue types assigned to tile edges. Assembly is driven by the attachment of singleton tiles to a growing seed assembly when the net force of glue attraction for a tile exceeds some fixed threshold. Within this frame work, we examine the time complexity of computing the sum or product of 2 n-bit numbers, where the input number"},"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":"1303.2416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-11T03:09:38Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"6a3381c7d630fd8c5e314881cd4ca66c57a29396352cf845832090019957e809","abstract_canon_sha256":"b4699a63b7636490b307e83eb933d86d017520f15c72fa8313a9cb61d4228d1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:49.375121Z","signature_b64":"4mYLKU7R1phE3rdo1U47/Q5Vo9HRYF/2OXYAMSF9dFZvbNZemFHNmSCYfBJrnlYnPVwvTvKHZYShY6XxJhecAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e6982ff49676f7008c1c309ff8978a1693e8df8e99c1523c91e978ae9fde376","last_reissued_at":"2026-05-18T03:16:49.374460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:49.374460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Arithmetic in Algorithmic Self-Assembly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.DS","authors_text":"Alexandra Keenan, Michael Sherman, Robert Schweller, Xingsi Zhong","submitted_at":"2013-03-11T03:09:38Z","abstract_excerpt":"In this paper we consider the time complexity of computing the sum and product of two $n$-bit numbers within the tile self-assembly model. The (abstract) tile assembly model is a mathematical model of self-assembly in which system components are square tiles with different glue types assigned to tile edges. Assembly is driven by the attachment of singleton tiles to a growing seed assembly when the net force of glue attraction for a tile exceeds some fixed threshold. Within this frame work, we examine the time complexity of computing the sum or product of 2 n-bit numbers, where the input number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2416","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":"1303.2416","created_at":"2026-05-18T03:16:49.374562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2416v2","created_at":"2026-05-18T03:16:49.374562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2416","created_at":"2026-05-18T03:16:49.374562+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZUYF72JM5XX","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZUYF72JM5XXACGB","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZUYF72J","created_at":"2026-05-18T12:27:51.066281+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/LZUYF72JM5XXACGBYME77CLYUF","json":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF.json","graph_json":"https://pith.science/api/pith-number/LZUYF72JM5XXACGBYME77CLYUF/graph.json","events_json":"https://pith.science/api/pith-number/LZUYF72JM5XXACGBYME77CLYUF/events.json","paper":"https://pith.science/paper/LZUYF72J"},"agent_actions":{"view_html":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF","download_json":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF.json","view_paper":"https://pith.science/paper/LZUYF72J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2416&json=true","fetch_graph":"https://pith.science/api/pith-number/LZUYF72JM5XXACGBYME77CLYUF/graph.json","fetch_events":"https://pith.science/api/pith-number/LZUYF72JM5XXACGBYME77CLYUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF/action/storage_attestation","attest_author":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF/action/author_attestation","sign_citation":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF/action/citation_signature","submit_replication":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF/action/replication_record"}},"created_at":"2026-05-18T03:16:49.374562+00:00","updated_at":"2026-05-18T03:16:49.374562+00:00"}