{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UEYDC2QACVNRTPLMIT34IPW3E6","short_pith_number":"pith:UEYDC2QA","schema_version":"1.0","canonical_sha256":"a130316a00155b19bd6c44f7c43edb278afb126f07580ede0e3078d291633319","source":{"kind":"arxiv","id":"1503.08078","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Complexity of Asynchronous Border Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Popa, Andreas Pfandler, Martin Kronegger, Robert Ganian","submitted_at":"2015-03-27T13:50:22Z","abstract_excerpt":"Microarrays are research tools used in gene discovery as well as disease and cancer diagnostics. Two prominent but challenging problems related to microarrays are the Border Minimization Problem (BMP) and the Border Minimization Problem with given placement (P-BMP).\n  In this paper we investigate the parameterized complexity of natural variants of BMP and P-BMP under several natural parameters. We show that BMP and P-BMP are in FPT under the following two combinations of parameters: 1) the size of the alphabet (c), the maximum length of a sequence (string) in the input (l) and the number of ro"},"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":"1503.08078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-27T13:50:22Z","cross_cats_sorted":[],"title_canon_sha256":"f5b1cb4d79ed374519ab9a337c06475e917ed1686f3dafabae118fe2ade0e253","abstract_canon_sha256":"a20a53550ad16addb1853c615d75d613d925dab722613c5a48f89839c547895c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:11.584459Z","signature_b64":"xtiM2KOcTyvExHSS4Jx/lFm3J8fflhAORqfl3rjKcMQGcv7PdX63SEpx70I9xxNqIYMpIOYr1ShEUFAyOgcJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a130316a00155b19bd6c44f7c43edb278afb126f07580ede0e3078d291633319","last_reissued_at":"2026-05-18T02:20:11.583930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:11.583930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Asynchronous Border Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Popa, Andreas Pfandler, Martin Kronegger, Robert Ganian","submitted_at":"2015-03-27T13:50:22Z","abstract_excerpt":"Microarrays are research tools used in gene discovery as well as disease and cancer diagnostics. Two prominent but challenging problems related to microarrays are the Border Minimization Problem (BMP) and the Border Minimization Problem with given placement (P-BMP).\n  In this paper we investigate the parameterized complexity of natural variants of BMP and P-BMP under several natural parameters. We show that BMP and P-BMP are in FPT under the following two combinations of parameters: 1) the size of the alphabet (c), the maximum length of a sequence (string) in the input (l) and the number of ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08078","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":"1503.08078","created_at":"2026-05-18T02:20:11.584018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08078v1","created_at":"2026-05-18T02:20:11.584018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08078","created_at":"2026-05-18T02:20:11.584018+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEYDC2QACVNR","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEYDC2QACVNRTPLM","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEYDC2QA","created_at":"2026-05-18T12:29:44.643036+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/UEYDC2QACVNRTPLMIT34IPW3E6","json":"https://pith.science/pith/UEYDC2QACVNRTPLMIT34IPW3E6.json","graph_json":"https://pith.science/api/pith-number/UEYDC2QACVNRTPLMIT34IPW3E6/graph.json","events_json":"https://pith.science/api/pith-number/UEYDC2QACVNRTPLMIT34IPW3E6/events.json","paper":"https://pith.science/paper/UEYDC2QA"},"agent_actions":{"view_html":"https://pith.science/pith/UEYDC2QACVNRTPLMIT34IPW3E6","download_json":"https://pith.science/pith/UEYDC2QACVNRTPLMIT34IPW3E6.json","view_paper":"https://pith.science/paper/UEYDC2QA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08078&json=true","fetch_graph":"https://pith.science/api/pith-number/UEYDC2QACVNRTPLMIT34IPW3E6/graph.json","fetch_events":"https://pith.science/api/pith-number/UEYDC2QACVNRTPLMIT34IPW3E6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEYDC2QACVNRTPLMIT34IPW3E6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEYDC2QACVNRTPLMIT34IPW3E6/action/storage_attestation","attest_author":"https://pith.science/pith/UEYDC2QACVNRTPLMIT34IPW3E6/action/author_attestation","sign_citation":"https://pith.science/pith/UEYDC2QACVNRTPLMIT34IPW3E6/action/citation_signature","submit_replication":"https://pith.science/pith/UEYDC2QACVNRTPLMIT34IPW3E6/action/replication_record"}},"created_at":"2026-05-18T02:20:11.584018+00:00","updated_at":"2026-05-18T02:20:11.584018+00:00"}