{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HLBKBZGR4GPO6NBU7U55CNLOXB","short_pith_number":"pith:HLBKBZGR","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"},"canonical_sha256":"3ac2a0e4d1e19eef3434fd3bd1356eb84b7fd0a37df3a1604486de874d5cddd0","source":{"kind":"arxiv","id":"1401.4739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4739","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4739v1","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4739","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"pith_short_12","alias_value":"HLBKBZGR4GPO","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HLBKBZGR4GPO6NBU","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HLBKBZGR","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HLBKBZGR4GPO6NBU7U55CNLOXB","target":"record","payload":{"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"},"canonical_sha256":"3ac2a0e4d1e19eef3434fd3bd1356eb84b7fd0a37df3a1604486de874d5cddd0","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"},"source_kind":"arxiv","source_id":"1401.4739","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-18T03:01:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSSXfCDBLeBoxlm+q9OtC42I+fESv1Any1z+pXsFfJWblfYQjT8PV9nkb85GQWyC7XkKQh+NuUDhrYLCV8r2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:21:51.925970Z"},"content_sha256":"faa3b7615d1be5dd799ec8e57b61403ba070e3fbf7555618f240ef4748a08a6c","schema_version":"1.0","event_id":"sha256:faa3b7615d1be5dd799ec8e57b61403ba070e3fbf7555618f240ef4748a08a6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HLBKBZGR4GPO6NBU7U55CNLOXB","target":"graph","payload":{"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"},"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:01:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQSvDZEK9WloysRBZa2Ax5OqtQhKUmu6BUMiGFIFVaUufSMm2PDH5c/QncEGW0JCGjaiefMKU6WX+0kRmyXHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:21:51.926543Z"},"content_sha256":"a81cae7d9ad746e3b0fd5b59212b01044283572c0cfbfc4951700b11af69b2d6","schema_version":"1.0","event_id":"sha256:a81cae7d9ad746e3b0fd5b59212b01044283572c0cfbfc4951700b11af69b2d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/bundle.json","state_url":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/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-01T06:21:51Z","links":{"resolver":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB","bundle":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/bundle.json","state":"https://pith.science/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLBKBZGR4GPO6NBU7U55CNLOXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HLBKBZGR4GPO6NBU7U55CNLOXB","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":"1969025b52bb8314186faf12351995d294e9a77ad39e59526b82a738fc53e819","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-19T21:24:33Z","title_canon_sha256":"8a8d3fc674b8087aafd3956da97c0a34234510352ec180ea28be9f4a2919da27"},"schema_version":"1.0","source":{"id":"1401.4739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4739","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4739v1","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4739","created_at":"2026-05-18T03:01:44Z"},{"alias_kind":"pith_short_12","alias_value":"HLBKBZGR4GPO","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HLBKBZGR4GPO6NBU","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HLBKBZGR","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:a81cae7d9ad746e3b0fd5b59212b01044283572c0cfbfc4951700b11af69b2d6","target":"graph","created_at":"2026-05-18T03:01:44Z","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":"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","authors_text":"Arash Rafiey, Jan Manuch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-19T21:24:33Z","title":"Finding minimum Tucker submatrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4739","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:faa3b7615d1be5dd799ec8e57b61403ba070e3fbf7555618f240ef4748a08a6c","target":"record","created_at":"2026-05-18T03:01:44Z","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":"1969025b52bb8314186faf12351995d294e9a77ad39e59526b82a738fc53e819","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-19T21:24:33Z","title_canon_sha256":"8a8d3fc674b8087aafd3956da97c0a34234510352ec180ea28be9f4a2919da27"},"schema_version":"1.0","source":{"id":"1401.4739","kind":"arxiv","version":1}},"canonical_sha256":"3ac2a0e4d1e19eef3434fd3bd1356eb84b7fd0a37df3a1604486de874d5cddd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ac2a0e4d1e19eef3434fd3bd1356eb84b7fd0a37df3a1604486de874d5cddd0","first_computed_at":"2026-05-18T03:01:44.776831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:44.776831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"keR2XeQLKGhrZ8glSAV1N0VhyN6MMmdutgLQESqxSl+TPvikOcAGkNkKwLmA2IldAoPXlu5RYQK1U2kjMlODBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:44.777463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faa3b7615d1be5dd799ec8e57b61403ba070e3fbf7555618f240ef4748a08a6c","sha256:a81cae7d9ad746e3b0fd5b59212b01044283572c0cfbfc4951700b11af69b2d6"],"state_sha256":"4f088f9923ef8c7f9227e145cd26b5b83063f12152365dff43c3a457c2c88308"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"shXjiXlhLBxMwDwzq5XUAvcLYY08+VxxNI4FH2AU2fxUXYFrW5vgQTqsBn4EUFAgn5ruBlFlEl7WeGuGGCN+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:21:51.930158Z","bundle_sha256":"5e7cb37518218d2dfee0f29fde4c55774ea0771a092b959c34e63ca965219d75"}}