{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3SEQBYLK6DQA7HZLXC6YWUZIRS","short_pith_number":"pith:3SEQBYLK","schema_version":"1.0","canonical_sha256":"dc8900e16af0e00f9f2bb8bd8b53288c9dd89f75f42d04fcdf9f7ea330abff1b","source":{"kind":"arxiv","id":"1109.0562","version":1},"attestation_state":"computed","paper":{"title":"A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cedric Chauve, Mehrnoush Malekesmaeili, Tamon Stephen","submitted_at":"2011-09-02T21:26:43Z","abstract_excerpt":"A binary matrix has the consecutive ones property (C1P) if it is possible to order the columns so that all 1s are consecutive in every row. In [McConnell, SODA 2004 768-777] the notion of incompatibility graph of a binary matrix was introduced and it was shown that odd cycles of this graph provide a certificate that a matrix does not have the consecutive ones property. A bound of (k+2) was claimed for the smallest odd cycle of a non-C1P matrix with k columns. In this note we show that this result can be obtained simply and directly via Tucker patterns, and that the correct bound is (k+2) when "},"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":"1109.0562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-02T21:26:43Z","cross_cats_sorted":[],"title_canon_sha256":"7bde5c98ac61a856b8812ce2c91dd7c43c061563fa0851e0312f9d65edaf9aa3","abstract_canon_sha256":"20fea1c464a26134f980e3a35bbd3b962e59d66133f981166cfc98678ac36e39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:07.321222Z","signature_b64":"j3AO9MumYSn91Xpg81Js5nYLyxvegpQIe7G/MDnOvalGt5kusQuBE7G+f+Dso9VkpWQQUiUHA4OfmLpw5KrvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc8900e16af0e00f9f2bb8bd8b53288c9dd89f75f42d04fcdf9f7ea330abff1b","last_reissued_at":"2026-05-18T04:14:07.320772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:07.320772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cedric Chauve, Mehrnoush Malekesmaeili, Tamon Stephen","submitted_at":"2011-09-02T21:26:43Z","abstract_excerpt":"A binary matrix has the consecutive ones property (C1P) if it is possible to order the columns so that all 1s are consecutive in every row. In [McConnell, SODA 2004 768-777] the notion of incompatibility graph of a binary matrix was introduced and it was shown that odd cycles of this graph provide a certificate that a matrix does not have the consecutive ones property. A bound of (k+2) was claimed for the smallest odd cycle of a non-C1P matrix with k columns. In this note we show that this result can be obtained simply and directly via Tucker patterns, and that the correct bound is (k+2) when "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0562","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":"1109.0562","created_at":"2026-05-18T04:14:07.320840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.0562v1","created_at":"2026-05-18T04:14:07.320840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0562","created_at":"2026-05-18T04:14:07.320840+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SEQBYLK6DQA","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SEQBYLK6DQA7HZL","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SEQBYLK","created_at":"2026-05-18T12:26:18.847500+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/3SEQBYLK6DQA7HZLXC6YWUZIRS","json":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS.json","graph_json":"https://pith.science/api/pith-number/3SEQBYLK6DQA7HZLXC6YWUZIRS/graph.json","events_json":"https://pith.science/api/pith-number/3SEQBYLK6DQA7HZLXC6YWUZIRS/events.json","paper":"https://pith.science/paper/3SEQBYLK"},"agent_actions":{"view_html":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS","download_json":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS.json","view_paper":"https://pith.science/paper/3SEQBYLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.0562&json=true","fetch_graph":"https://pith.science/api/pith-number/3SEQBYLK6DQA7HZLXC6YWUZIRS/graph.json","fetch_events":"https://pith.science/api/pith-number/3SEQBYLK6DQA7HZLXC6YWUZIRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/action/storage_attestation","attest_author":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/action/author_attestation","sign_citation":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/action/citation_signature","submit_replication":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/action/replication_record"}},"created_at":"2026-05-18T04:14:07.320840+00:00","updated_at":"2026-05-18T04:14:07.320840+00:00"}