{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DCQLG4Z6EJJX4SMVEIR5DHVO5F","short_pith_number":"pith:DCQLG4Z6","schema_version":"1.0","canonical_sha256":"18a0b3733e22537e49952223d19eaee964e2faa029185276fa966d7c4d6d412e","source":{"kind":"arxiv","id":"1206.1837","version":2},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Finding Tucker Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Cedric Chauve, Maria Tamayo, Tamon Stephen","submitted_at":"2012-06-08T18:54:33Z","abstract_excerpt":"The Consecutive Ones Property is an important notion for binary matrices, both from a theoretical and applied point of view. Tucker gave in 1972 a characterization of matrices that do not satisfy the Consecutive Ones Property in terms of forbidden submatrices, the Tucker patterns. We describe here a linear time algorithm to find a Tucker pattern in a non-C1P binary matrix, which allows to extract in linear time a certificate for the non-C1P. We also describe an output-sensitive algorithm to enumerate all Tucker patterns of a non-C1P binary matrix.\n\nThis paper had been withdrawn due to some mis"},"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":"1206.1837","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-08T18:54:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d51b9c3686222fed2c489795b6ea9d8d129320401c3663938ce8dfcf6c67e852","abstract_canon_sha256":"e5628452e2f547fd0b5d184c178d46c0d442253190ae81917b64f5cef9385164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:00.653166Z","signature_b64":"ZROaW2XLgugFuO3Z7G2Dl8D0Jf65cpnSLqoXKm6wiFUWerlHvuCoHaIZ9EdCVKhc+azj3JTl0A5W67fSvBrUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18a0b3733e22537e49952223d19eaee964e2faa029185276fa966d7c4d6d412e","last_reissued_at":"2026-05-18T03:52:00.652385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:00.652385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Finding Tucker Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Cedric Chauve, Maria Tamayo, Tamon Stephen","submitted_at":"2012-06-08T18:54:33Z","abstract_excerpt":"The Consecutive Ones Property is an important notion for binary matrices, both from a theoretical and applied point of view. Tucker gave in 1972 a characterization of matrices that do not satisfy the Consecutive Ones Property in terms of forbidden submatrices, the Tucker patterns. We describe here a linear time algorithm to find a Tucker pattern in a non-C1P binary matrix, which allows to extract in linear time a certificate for the non-C1P. We also describe an output-sensitive algorithm to enumerate all Tucker patterns of a non-C1P binary matrix.\n\nThis paper had been withdrawn due to some mis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1837","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.1837","created_at":"2026-05-18T03:52:00.652482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1837v2","created_at":"2026-05-18T03:52:00.652482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1837","created_at":"2026-05-18T03:52:00.652482+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCQLG4Z6EJJX","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCQLG4Z6EJJX4SMV","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCQLG4Z6","created_at":"2026-05-18T12:27:01.376967+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/DCQLG4Z6EJJX4SMVEIR5DHVO5F","json":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F.json","graph_json":"https://pith.science/api/pith-number/DCQLG4Z6EJJX4SMVEIR5DHVO5F/graph.json","events_json":"https://pith.science/api/pith-number/DCQLG4Z6EJJX4SMVEIR5DHVO5F/events.json","paper":"https://pith.science/paper/DCQLG4Z6"},"agent_actions":{"view_html":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F","download_json":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F.json","view_paper":"https://pith.science/paper/DCQLG4Z6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1837&json=true","fetch_graph":"https://pith.science/api/pith-number/DCQLG4Z6EJJX4SMVEIR5DHVO5F/graph.json","fetch_events":"https://pith.science/api/pith-number/DCQLG4Z6EJJX4SMVEIR5DHVO5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/action/storage_attestation","attest_author":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/action/author_attestation","sign_citation":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/action/citation_signature","submit_replication":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/action/replication_record"}},"created_at":"2026-05-18T03:52:00.652482+00:00","updated_at":"2026-05-18T03:52:00.652482+00:00"}