{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LZUYF72JM5XXACGBYME77CLYUF","short_pith_number":"pith:LZUYF72J","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"},"canonical_sha256":"5e6982ff49676f7008c1c309ff8978a1693e8df8e99c1523c91e978ae9fde376","source":{"kind":"arxiv","id":"1303.2416","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2416","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2416v2","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2416","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"LZUYF72JM5XX","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LZUYF72JM5XXACGB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LZUYF72J","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LZUYF72JM5XXACGBYME77CLYUF","target":"record","payload":{"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"},"canonical_sha256":"5e6982ff49676f7008c1c309ff8978a1693e8df8e99c1523c91e978ae9fde376","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"},"source_kind":"arxiv","source_id":"1303.2416","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-18T03:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hDvu3pUJ6sWbWdhHdlmeNvmJbAcIIZix3DVq3CmEQQjIzBC/WnTP7ufKmhhrOt04KuKUGfCCFAq1RroLtYPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:27:43.700749Z"},"content_sha256":"ed3eca59204c2fc20422d615a298875f96c125818793db02dbb26ecc6f5d7355","schema_version":"1.0","event_id":"sha256:ed3eca59204c2fc20422d615a298875f96c125818793db02dbb26ecc6f5d7355"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LZUYF72JM5XXACGBYME77CLYUF","target":"graph","payload":{"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"},"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-18T03:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J5btef2NryQsrz88mbJ1fRfaX2/H5ds+FvvMkKiTaKKFhmTt4cQrW6PmWybIkmy8G6hjwI9fKS8k7eFYHZl2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:27:43.701101Z"},"content_sha256":"205a74577b0d74743d0f8868edb3fd37849bca3e7e1748a46797e49928216511","schema_version":"1.0","event_id":"sha256:205a74577b0d74743d0f8868edb3fd37849bca3e7e1748a46797e49928216511"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF/bundle.json","state_url":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZUYF72JM5XXACGBYME77CLYUF/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-06-05T10:27:43Z","links":{"resolver":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF","bundle":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF/bundle.json","state":"https://pith.science/pith/LZUYF72JM5XXACGBYME77CLYUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZUYF72JM5XXACGBYME77CLYUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LZUYF72JM5XXACGBYME77CLYUF","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":"b4699a63b7636490b307e83eb933d86d017520f15c72fa8313a9cb61d4228d1a","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-11T03:09:38Z","title_canon_sha256":"6a3381c7d630fd8c5e314881cd4ca66c57a29396352cf845832090019957e809"},"schema_version":"1.0","source":{"id":"1303.2416","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2416","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2416v2","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2416","created_at":"2026-05-18T03:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"LZUYF72JM5XX","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LZUYF72JM5XXACGB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LZUYF72J","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:205a74577b0d74743d0f8868edb3fd37849bca3e7e1748a46797e49928216511","target":"graph","created_at":"2026-05-18T03:16:49Z","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":"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","authors_text":"Alexandra Keenan, Michael Sherman, Robert Schweller, Xingsi Zhong","cross_cats":["cs.CC","cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-11T03:09:38Z","title":"Fast Arithmetic in Algorithmic Self-Assembly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2416","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:ed3eca59204c2fc20422d615a298875f96c125818793db02dbb26ecc6f5d7355","target":"record","created_at":"2026-05-18T03:16:49Z","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":"b4699a63b7636490b307e83eb933d86d017520f15c72fa8313a9cb61d4228d1a","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-11T03:09:38Z","title_canon_sha256":"6a3381c7d630fd8c5e314881cd4ca66c57a29396352cf845832090019957e809"},"schema_version":"1.0","source":{"id":"1303.2416","kind":"arxiv","version":2}},"canonical_sha256":"5e6982ff49676f7008c1c309ff8978a1693e8df8e99c1523c91e978ae9fde376","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e6982ff49676f7008c1c309ff8978a1693e8df8e99c1523c91e978ae9fde376","first_computed_at":"2026-05-18T03:16:49.374460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:49.374460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4mYLKU7R1phE3rdo1U47/Q5Vo9HRYF/2OXYAMSF9dFZvbNZemFHNmSCYfBJrnlYnPVwvTvKHZYShY6XxJhecAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:49.375121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2416","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed3eca59204c2fc20422d615a298875f96c125818793db02dbb26ecc6f5d7355","sha256:205a74577b0d74743d0f8868edb3fd37849bca3e7e1748a46797e49928216511"],"state_sha256":"3da4a61df1f2761a3801ab218f5a0206e8708e97db31cb9781a6d0d5bed16144"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q1wcrHCZEgNLvvfyPLQhcf6gzzT42thcgNN02b2TpdeqA1QVdT/Ez8m4MAQjOEondoA5cOQ0BqtEO8YjEk7cCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:27:43.703176Z","bundle_sha256":"0a2a26dc361f1897d16f03025b7365fa8d364fe59f7a12e74f89c73d72686af9"}}