{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3SEQBYLK6DQA7HZLXC6YWUZIRS","short_pith_number":"pith:3SEQBYLK","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"},"canonical_sha256":"dc8900e16af0e00f9f2bb8bd8b53288c9dd89f75f42d04fcdf9f7ea330abff1b","source":{"kind":"arxiv","id":"1109.0562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0562","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0562v1","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0562","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"3SEQBYLK6DQA","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3SEQBYLK6DQA7HZL","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3SEQBYLK","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3SEQBYLK6DQA7HZLXC6YWUZIRS","target":"record","payload":{"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"},"canonical_sha256":"dc8900e16af0e00f9f2bb8bd8b53288c9dd89f75f42d04fcdf9f7ea330abff1b","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"},"source_kind":"arxiv","source_id":"1109.0562","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-18T04:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbqjN5968Qv3LJGPRRElhkYQGYNqyqAKWNyM4icj1K15/l8GbCC8LSesKW83Z5BzyO7u/Pjj14DF5jzlajHiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:06:11.094234Z"},"content_sha256":"aeaabc3c8389f5b2841c4165e02a8bcba38f977fc451b33a381757c699db4f0e","schema_version":"1.0","event_id":"sha256:aeaabc3c8389f5b2841c4165e02a8bcba38f977fc451b33a381757c699db4f0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3SEQBYLK6DQA7HZLXC6YWUZIRS","target":"graph","payload":{"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"},"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-18T04:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WLSAltg8eSgbA3GwVuUC1NzGUNx0Rujqxg4+TikrM+KGBwhsXiRuyOtvNrPLXDdOOUA/22V7gW60HQjcbtFFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:06:11.094603Z"},"content_sha256":"284d8cb459d3ce4d59fd4979ad9b1311097954ef4931bff21a41cc8cadd0223d","schema_version":"1.0","event_id":"sha256:284d8cb459d3ce4d59fd4979ad9b1311097954ef4931bff21a41cc8cadd0223d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/bundle.json","state_url":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/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-05T11:06:11Z","links":{"resolver":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS","bundle":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/bundle.json","state":"https://pith.science/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SEQBYLK6DQA7HZLXC6YWUZIRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3SEQBYLK6DQA7HZLXC6YWUZIRS","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":"20fea1c464a26134f980e3a35bbd3b962e59d66133f981166cfc98678ac36e39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-02T21:26:43Z","title_canon_sha256":"7bde5c98ac61a856b8812ce2c91dd7c43c061563fa0851e0312f9d65edaf9aa3"},"schema_version":"1.0","source":{"id":"1109.0562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0562","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0562v1","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0562","created_at":"2026-05-18T04:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"3SEQBYLK6DQA","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3SEQBYLK6DQA7HZL","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3SEQBYLK","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:284d8cb459d3ce4d59fd4979ad9b1311097954ef4931bff21a41cc8cadd0223d","target":"graph","created_at":"2026-05-18T04:14:07Z","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 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 ","authors_text":"Cedric Chauve, Mehrnoush Malekesmaeili, Tamon Stephen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-02T21:26:43Z","title":"A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0562","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:aeaabc3c8389f5b2841c4165e02a8bcba38f977fc451b33a381757c699db4f0e","target":"record","created_at":"2026-05-18T04:14:07Z","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":"20fea1c464a26134f980e3a35bbd3b962e59d66133f981166cfc98678ac36e39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-02T21:26:43Z","title_canon_sha256":"7bde5c98ac61a856b8812ce2c91dd7c43c061563fa0851e0312f9d65edaf9aa3"},"schema_version":"1.0","source":{"id":"1109.0562","kind":"arxiv","version":1}},"canonical_sha256":"dc8900e16af0e00f9f2bb8bd8b53288c9dd89f75f42d04fcdf9f7ea330abff1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc8900e16af0e00f9f2bb8bd8b53288c9dd89f75f42d04fcdf9f7ea330abff1b","first_computed_at":"2026-05-18T04:14:07.320772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:07.320772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j3AO9MumYSn91Xpg81Js5nYLyxvegpQIe7G/MDnOvalGt5kusQuBE7G+f+Dso9VkpWQQUiUHA4OfmLpw5KrvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:07.321222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.0562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aeaabc3c8389f5b2841c4165e02a8bcba38f977fc451b33a381757c699db4f0e","sha256:284d8cb459d3ce4d59fd4979ad9b1311097954ef4931bff21a41cc8cadd0223d"],"state_sha256":"433353829f9cec92d68d515a93ca3c871c38341ab7a4bd50ab8c252cf75bdf2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TmplXTS4vDua99MKw7ICaDOp3xG2W7TbU1M7ct469UOLqgXDMwt5Pg53tVtZph0SVV5NhNH1S3YPjivk0hrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:06:11.096930Z","bundle_sha256":"34a5ccc3cae21b30a0a569845162859a6af5377123dd206a73d81f0edf9cf03b"}}