{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DCQLG4Z6EJJX4SMVEIR5DHVO5F","short_pith_number":"pith:DCQLG4Z6","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"},"canonical_sha256":"18a0b3733e22537e49952223d19eaee964e2faa029185276fa966d7c4d6d412e","source":{"kind":"arxiv","id":"1206.1837","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1837","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1837v2","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1837","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"DCQLG4Z6EJJX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DCQLG4Z6EJJX4SMV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DCQLG4Z6","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DCQLG4Z6EJJX4SMVEIR5DHVO5F","target":"record","payload":{"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"},"canonical_sha256":"18a0b3733e22537e49952223d19eaee964e2faa029185276fa966d7c4d6d412e","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"},"source_kind":"arxiv","source_id":"1206.1837","source_version":2,"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-18T03:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2D9U0AjHgmXPUBj5yTiOk5274seWlSAR8n2GwNB7UlhaBcMv5wZtbSz4JxhSlhinSuQsqTRlxtZ955vy5dXAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T18:07:20.960527Z"},"content_sha256":"adea028d4ce2323622a1770997a5064474349275ccbebf61244a5d1dd17727ae","schema_version":"1.0","event_id":"sha256:adea028d4ce2323622a1770997a5064474349275ccbebf61244a5d1dd17727ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DCQLG4Z6EJJX4SMVEIR5DHVO5F","target":"graph","payload":{"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"},"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-18T03:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWoIBFHn1UThoZsDyElEyEfsoJAMc+m9wBg52P/EDuobKkH+mdxFF+iav68Bzhh+oGVaTaawdpE6EZ10fzEaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T18:07:20.960870Z"},"content_sha256":"a80dcf3e83b31713391b0502b2cd8d318484439929d44bf8c8a1956d9a2291a7","schema_version":"1.0","event_id":"sha256:a80dcf3e83b31713391b0502b2cd8d318484439929d44bf8c8a1956d9a2291a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/bundle.json","state_url":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/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-21T18:07:20Z","links":{"resolver":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F","bundle":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/bundle.json","state":"https://pith.science/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCQLG4Z6EJJX4SMVEIR5DHVO5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DCQLG4Z6EJJX4SMVEIR5DHVO5F","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":"e5628452e2f547fd0b5d184c178d46c0d442253190ae81917b64f5cef9385164","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-08T18:54:33Z","title_canon_sha256":"d51b9c3686222fed2c489795b6ea9d8d129320401c3663938ce8dfcf6c67e852"},"schema_version":"1.0","source":{"id":"1206.1837","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1837","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1837v2","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1837","created_at":"2026-05-18T03:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"DCQLG4Z6EJJX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DCQLG4Z6EJJX4SMV","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DCQLG4Z6","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:a80dcf3e83b31713391b0502b2cd8d318484439929d44bf8c8a1956d9a2291a7","target":"graph","created_at":"2026-05-18T03:52:00Z","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":"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","authors_text":"Cedric Chauve, Maria Tamayo, Tamon Stephen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-08T18:54:33Z","title":"Efficient Algorithms for Finding Tucker Patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1837","kind":"arxiv","version":2},"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:adea028d4ce2323622a1770997a5064474349275ccbebf61244a5d1dd17727ae","target":"record","created_at":"2026-05-18T03:52:00Z","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":"e5628452e2f547fd0b5d184c178d46c0d442253190ae81917b64f5cef9385164","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-08T18:54:33Z","title_canon_sha256":"d51b9c3686222fed2c489795b6ea9d8d129320401c3663938ce8dfcf6c67e852"},"schema_version":"1.0","source":{"id":"1206.1837","kind":"arxiv","version":2}},"canonical_sha256":"18a0b3733e22537e49952223d19eaee964e2faa029185276fa966d7c4d6d412e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18a0b3733e22537e49952223d19eaee964e2faa029185276fa966d7c4d6d412e","first_computed_at":"2026-05-18T03:52:00.652385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:00.652385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZROaW2XLgugFuO3Z7G2Dl8D0Jf65cpnSLqoXKm6wiFUWerlHvuCoHaIZ9EdCVKhc+azj3JTl0A5W67fSvBrUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:00.653166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1837","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adea028d4ce2323622a1770997a5064474349275ccbebf61244a5d1dd17727ae","sha256:a80dcf3e83b31713391b0502b2cd8d318484439929d44bf8c8a1956d9a2291a7"],"state_sha256":"2491e195aaca82b48564381a5c1b658697c302fb3b80f3bc179ef06cd80ff24f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrYTY7RyamOAtSM0/R9QB921slWge1MUyQn2Dc2lrLO/LnXAGe4SniVmPA1/XFj4n11h8ScyJZJ2wpvqcXd0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T18:07:20.962831Z","bundle_sha256":"62839c6eab11d4d689d1d9ee850083391882bd37ffe8e6ea5960eaa988488cd7"}}