{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HLBKBZGR4GPO6NBU7U55CNLOXB","short_pith_number":"pith:HLBKBZGR","schema_version":"1.0","canonical_sha256":"3ac2a0e4d1e19eef3434fd3bd1356eb84b7fd0a37df3a1604486de874d5cddd0","source":{"kind":"arxiv","id":"1401.4739","version":1},"attestation_state":"computed","paper":{"title":"Finding minimum Tucker submatrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arash Rafiey, Jan Manuch","submitted_at":"2014-01-19T21:24:33Z","abstract_excerpt":"A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. These matrices are used for DNA physical mapping and ancestral genome reconstruction in computational biology on the other hand they represents a class of convex bipartite graphs and are of interest of algorithm graph theory researchers. Tucker gave a forbidden submartices characterization of matrices that have C1P property in 1972. Booth and Lucker (1976) gave a first linear time recognition algorithm for matrices with C1P property and then in 2002, Habi"},"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":"1401.4739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-19T21:24:33Z","cross_cats_sorted":[],"title_canon_sha256":"8a8d3fc674b8087aafd3956da97c0a34234510352ec180ea28be9f4a2919da27","abstract_canon_sha256":"1969025b52bb8314186faf12351995d294e9a77ad39e59526b82a738fc53e819"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:44.777463Z","signature_b64":"keR2XeQLKGhrZ8glSAV1N0VhyN6MMmdutgLQESqxSl+TPvikOcAGkNkKwLmA2IldAoPXlu5RYQK1U2kjMlODBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ac2a0e4d1e19eef3434fd3bd1356eb84b7fd0a37df3a1604486de874d5cddd0","last_reissued_at":"2026-05-18T03:01:44.776831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:44.776831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding minimum Tucker submatrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arash Rafiey, Jan Manuch","submitted_at":"2014-01-19T21:24:33Z","abstract_excerpt":"A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. These matrices are used for DNA physical mapping and ancestral genome reconstruction in computational biology on the other hand they represents a class of convex bipartite graphs and are of interest of algorithm graph theory researchers. Tucker gave a forbidden submartices characterization of matrices that have C1P property in 1972. Booth and Lucker (1976) gave a first linear time recognition algorithm for matrices with C1P property and then in 2002, Habi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4739","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":"1401.4739","created_at":"2026-05-18T03:01:44.776927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4739v1","created_at":"2026-05-18T03:01:44.776927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4739","created_at":"2026-05-18T03:01:44.776927+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLBKBZGR4GPO","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLBKBZGR4GPO6NBU","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLBKBZGR","created_at":"2026-05-18T12:28:30.664211+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/HLBKBZGR4GPO6NBU7U55CNLOXB","json":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB.json","graph_json":"https://pith.science/api/pith-number/HLBKBZGR4GPO6NBU7U55CNLOXB/graph.json","events_json":"https://pith.science/api/pith-number/HLBKBZGR4GPO6NBU7U55CNLOXB/events.json","paper":"https://pith.science/paper/HLBKBZGR"},"agent_actions":{"view_html":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB","download_json":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB.json","view_paper":"https://pith.science/paper/HLBKBZGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4739&json=true","fetch_graph":"https://pith.science/api/pith-number/HLBKBZGR4GPO6NBU7U55CNLOXB/graph.json","fetch_events":"https://pith.science/api/pith-number/HLBKBZGR4GPO6NBU7U55CNLOXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/action/storage_attestation","attest_author":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/action/author_attestation","sign_citation":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/action/citation_signature","submit_replication":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/action/replication_record"}},"created_at":"2026-05-18T03:01:44.776927+00:00","updated_at":"2026-05-18T03:01:44.776927+00:00"}