{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RAGBYRVHUZBT44CVZEBOO47LKJ","short_pith_number":"pith:RAGBYRVH","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"},"canonical_sha256":"880c1c46a7a6433e7055c902e773eb5273234ab628b2da1966b7db1720c70a2b","source":{"kind":"arxiv","id":"1011.1202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1202","created_at":"2026-05-18T04:37:01Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1202v1","created_at":"2026-05-18T04:37:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1202","created_at":"2026-05-18T04:37:01Z"},{"alias_kind":"pith_short_12","alias_value":"RAGBYRVHUZBT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RAGBYRVHUZBT44CV","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RAGBYRVH","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RAGBYRVHUZBT44CVZEBOO47LKJ","target":"record","payload":{"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"},"canonical_sha256":"880c1c46a7a6433e7055c902e773eb5273234ab628b2da1966b7db1720c70a2b","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"},"source_kind":"arxiv","source_id":"1011.1202","source_version":1,"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-18T04:37:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0q6oUn/SvWBdbbz/G38bage2ooVxoWGq3j0E/WzC9mSWN8MnEUPQNs426RL4oi/hB1JQw2UnSYPt6rd8xo0IBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:59:11.001560Z"},"content_sha256":"3625189ce573f8b082f706d5176ee9abe5d7cf17a09ec866df756b7fb1ba0c76","schema_version":"1.0","event_id":"sha256:3625189ce573f8b082f706d5176ee9abe5d7cf17a09ec866df756b7fb1ba0c76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RAGBYRVHUZBT44CVZEBOO47LKJ","target":"graph","payload":{"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"},"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-18T04:37:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3sxhDAxzhKjPYiZovWETBuL2m9sgChaLdFF5e2oEI/5/3maCmutPTOWhV+9hmJAZyLKvR6OZXj7IbKG5qxv8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:59:11.001902Z"},"content_sha256":"9fd764dadf0178d4ce714132d21bb02a72a7eca6c568bcd0ec21846e106a4fff","schema_version":"1.0","event_id":"sha256:9fd764dadf0178d4ce714132d21bb02a72a7eca6c568bcd0ec21846e106a4fff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/bundle.json","state_url":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/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-03T16:59:11Z","links":{"resolver":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ","bundle":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/bundle.json","state":"https://pith.science/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAGBYRVHUZBT44CVZEBOO47LKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RAGBYRVHUZBT44CVZEBOO47LKJ","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":"6f44347a03153ab3ef30de0141f7ea8723fc4c82c6de512da973e84c72e77e1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-04T16:25:26Z","title_canon_sha256":"7e532078f67058557b00c6a9ebb10cd5d6796a28a798ad51fdbac44bb84c631b"},"schema_version":"1.0","source":{"id":"1011.1202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1202","created_at":"2026-05-18T04:37:01Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1202v1","created_at":"2026-05-18T04:37:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1202","created_at":"2026-05-18T04:37:01Z"},{"alias_kind":"pith_short_12","alias_value":"RAGBYRVHUZBT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RAGBYRVHUZBT44CV","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RAGBYRVH","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:9fd764dadf0178d4ce714132d21bb02a72a7eca6c568bcd0ec21846e106a4fff","target":"graph","created_at":"2026-05-18T04:37:01Z","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":"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","authors_text":"Alexandru Popa, Fencol C.C. Yung, Prudence W.H. Wong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-04T16:25:26Z","title":"Hardness and Approximation of The Asynchronous Border Minimization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1202","kind":"arxiv","version":1},"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:3625189ce573f8b082f706d5176ee9abe5d7cf17a09ec866df756b7fb1ba0c76","target":"record","created_at":"2026-05-18T04:37:01Z","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":"6f44347a03153ab3ef30de0141f7ea8723fc4c82c6de512da973e84c72e77e1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-04T16:25:26Z","title_canon_sha256":"7e532078f67058557b00c6a9ebb10cd5d6796a28a798ad51fdbac44bb84c631b"},"schema_version":"1.0","source":{"id":"1011.1202","kind":"arxiv","version":1}},"canonical_sha256":"880c1c46a7a6433e7055c902e773eb5273234ab628b2da1966b7db1720c70a2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"880c1c46a7a6433e7055c902e773eb5273234ab628b2da1966b7db1720c70a2b","first_computed_at":"2026-05-18T04:37:01.764770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:37:01.764770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IyUgcuTUSjsj/bI9k1Q+96+papUld/89TUdKItdcj2yZ9YNmmuebtkF+YVF8+Pk9+CVS9R2LULpt5fTb9ZySAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:37:01.765475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3625189ce573f8b082f706d5176ee9abe5d7cf17a09ec866df756b7fb1ba0c76","sha256:9fd764dadf0178d4ce714132d21bb02a72a7eca6c568bcd0ec21846e106a4fff"],"state_sha256":"41f51e615fe6c71c609660c52ad74160065e57edc04f45eb898f74248d01da58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JDOM/dRzb3AChPMAvr+K235+YXqN+aL5iZWKuKm0PF44VHwUt7OrvjBjsiin5DZk+Eo/ToJmKNaWUPSMLnNFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:59:11.003790Z","bundle_sha256":"5f5a44a66e480e7010134a7aa2b8cfe430a05ae593f0a22fd644d43a0e6c8e9d"}}