{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:RAGBYRVHUZBT44CVZEBOO47LKJ","short_pith_number":"pith:RAGBYRVH","schema_version":"1.0","canonical_sha256":"880c1c46a7a6433e7055c902e773eb5273234ab628b2da1966b7db1720c70a2b","source":{"kind":"arxiv","id":"1011.1202","version":1},"attestation_state":"computed","paper":{"title":"Hardness and Approximation of The Asynchronous Border Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Popa, Fencol C.C. Yung, Prudence W.H. Wong","submitted_at":"2010-11-04T16:25:26Z","abstract_excerpt":"We study a combinatorial problem arising from microarrays synthesis. The synthesis is done by a light-directed chemical process. The objective is to minimize unintended illumination that may contaminate the quality of experiments. Unintended illumination is measured by a notion called border length and the problem is called Border Minimization Problem (BMP). The objective of the BMP is to place a set of probe sequences in the array and find an embedding (deposition of nucleotides/residues to the array cells) such that the sum of border length is minimized. A variant of the problem, called P-BM"},"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":"1011.1202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-04T16:25:26Z","cross_cats_sorted":[],"title_canon_sha256":"7e532078f67058557b00c6a9ebb10cd5d6796a28a798ad51fdbac44bb84c631b","abstract_canon_sha256":"6f44347a03153ab3ef30de0141f7ea8723fc4c82c6de512da973e84c72e77e1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:01.765475Z","signature_b64":"IyUgcuTUSjsj/bI9k1Q+96+papUld/89TUdKItdcj2yZ9YNmmuebtkF+YVF8+Pk9+CVS9R2LULpt5fTb9ZySAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"880c1c46a7a6433e7055c902e773eb5273234ab628b2da1966b7db1720c70a2b","last_reissued_at":"2026-05-18T04:37:01.764770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:01.764770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness and Approximation of The Asynchronous Border Minimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Popa, Fencol C.C. Yung, Prudence W.H. Wong","submitted_at":"2010-11-04T16:25:26Z","abstract_excerpt":"We study a combinatorial problem arising from microarrays synthesis. The synthesis is done by a light-directed chemical process. The objective is to minimize unintended illumination that may contaminate the quality of experiments. Unintended illumination is measured by a notion called border length and the problem is called Border Minimization Problem (BMP). The objective of the BMP is to place a set of probe sequences in the array and find an embedding (deposition of nucleotides/residues to the array cells) such that the sum of border length is minimized. A variant of the problem, called P-BM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1202","kind":"arxiv","version":1},"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":"1011.1202","created_at":"2026-05-18T04:37:01.764910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1202v1","created_at":"2026-05-18T04:37:01.764910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1202","created_at":"2026-05-18T04:37:01.764910+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAGBYRVHUZBT","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAGBYRVHUZBT44CV","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAGBYRVH","created_at":"2026-05-18T12:26:13.927090+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/RAGBYRVHUZBT44CVZEBOO47LKJ","json":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ.json","graph_json":"https://pith.science/api/pith-number/RAGBYRVHUZBT44CVZEBOO47LKJ/graph.json","events_json":"https://pith.science/api/pith-number/RAGBYRVHUZBT44CVZEBOO47LKJ/events.json","paper":"https://pith.science/paper/RAGBYRVH"},"agent_actions":{"view_html":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ","download_json":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ.json","view_paper":"https://pith.science/paper/RAGBYRVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1202&json=true","fetch_graph":"https://pith.science/api/pith-number/RAGBYRVHUZBT44CVZEBOO47LKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RAGBYRVHUZBT44CVZEBOO47LKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/action/storage_attestation","attest_author":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/action/author_attestation","sign_citation":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/action/citation_signature","submit_replication":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/action/replication_record"}},"created_at":"2026-05-18T04:37:01.764910+00:00","updated_at":"2026-05-18T04:37:01.764910+00:00"}