{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6AIL3C4HJU7D3PT3LXLIZB5DWF","short_pith_number":"pith:6AIL3C4H","canonical_record":{"source":{"id":"1007.0602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-07-05T02:15:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"59add690924158822748271599a87270487ebe380884ca7ff4db90c2db0cd867","abstract_canon_sha256":"e8d552413f167ad34267d1fae132a001b031a5434f8285417ab2a25657cd910d"},"schema_version":"1.0"},"canonical_sha256":"f010bd8b874d3e3dbe7b5dd68c87a3b1498c44a293fe378f275475f0f769ab80","source":{"kind":"arxiv","id":"1007.0602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0602","created_at":"2026-05-18T03:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0602v1","created_at":"2026-05-18T03:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0602","created_at":"2026-05-18T03:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"6AIL3C4HJU7D","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6AIL3C4HJU7D3PT3","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6AIL3C4H","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6AIL3C4HJU7D3PT3LXLIZB5DWF","target":"record","payload":{"canonical_record":{"source":{"id":"1007.0602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-07-05T02:15:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"59add690924158822748271599a87270487ebe380884ca7ff4db90c2db0cd867","abstract_canon_sha256":"e8d552413f167ad34267d1fae132a001b031a5434f8285417ab2a25657cd910d"},"schema_version":"1.0"},"canonical_sha256":"f010bd8b874d3e3dbe7b5dd68c87a3b1498c44a293fe378f275475f0f769ab80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:50.760404Z","signature_b64":"YOSW9gllQ7UM4sF8DV8d9IlrAwS/dG5hsLLSkv0oW4H/QRJaIQOlAqayR5AcNAlVBahHxTGqPMAWUYaNyqsMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f010bd8b874d3e3dbe7b5dd68c87a3b1498c44a293fe378f275475f0f769ab80","last_reissued_at":"2026-05-18T03:57:50.759795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:50.759795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.0602","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1yeXcapLkTjzS09KAtPg/FhZVi5BGJC4wpCRxyXuSjQ9Z1q1ErjHSYMsIU5qUvCvkZ2SNDmebdH+fN78le2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:10:31.766927Z"},"content_sha256":"3d9743ce69fb7b9602d8418520fc9a8cf3f9a4c6e49ff00f67141837ff408e0f","schema_version":"1.0","event_id":"sha256:3d9743ce69fb7b9602d8418520fc9a8cf3f9a4c6e49ff00f67141837ff408e0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6AIL3C4HJU7D3PT3LXLIZB5DWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On The Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.AI","authors_text":"George Katsirelos, Nina Narodytska, Toby Walsh","submitted_at":"2010-07-05T02:15:00Z","abstract_excerpt":"We consider a common type of symmetry where we have a matrix of decision variables with interchangeable rows and columns. A simple and efficient method to deal with such row and column symmetry is to post symmetry breaking constraints like DOUBLELEX and SNAKELEX. We provide a number of positive and negative results on posting such symmetry breaking constraints. On the positive side, we prove that we can compute in polynomial time a unique representative of an equivalence class in a matrix model with row and column symmetry if the number of rows (or of columns) is bounded and in a number of oth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0602","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcRqAd3mIU5dnbzwF1qUJm6/LI5y6/z5SN3kxbwAjb338OyY++3Fw0QXozCiB6D25YYzIjSlEaaBS9bo90ZJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:10:31.767276Z"},"content_sha256":"23fd81d4c20b153ec4fa4357d3cb0bde46dc73bb089a69aa3c950800a82d26b3","schema_version":"1.0","event_id":"sha256:23fd81d4c20b153ec4fa4357d3cb0bde46dc73bb089a69aa3c950800a82d26b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AIL3C4HJU7D3PT3LXLIZB5DWF/bundle.json","state_url":"https://pith.science/pith/6AIL3C4HJU7D3PT3LXLIZB5DWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AIL3C4HJU7D3PT3LXLIZB5DWF/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-26T21:10:31Z","links":{"resolver":"https://pith.science/pith/6AIL3C4HJU7D3PT3LXLIZB5DWF","bundle":"https://pith.science/pith/6AIL3C4HJU7D3PT3LXLIZB5DWF/bundle.json","state":"https://pith.science/pith/6AIL3C4HJU7D3PT3LXLIZB5DWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AIL3C4HJU7D3PT3LXLIZB5DWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6AIL3C4HJU7D3PT3LXLIZB5DWF","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":"e8d552413f167ad34267d1fae132a001b031a5434f8285417ab2a25657cd910d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-07-05T02:15:00Z","title_canon_sha256":"59add690924158822748271599a87270487ebe380884ca7ff4db90c2db0cd867"},"schema_version":"1.0","source":{"id":"1007.0602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0602","created_at":"2026-05-18T03:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0602v1","created_at":"2026-05-18T03:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0602","created_at":"2026-05-18T03:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"6AIL3C4HJU7D","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6AIL3C4HJU7D3PT3","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6AIL3C4H","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:23fd81d4c20b153ec4fa4357d3cb0bde46dc73bb089a69aa3c950800a82d26b3","target":"graph","created_at":"2026-05-18T03:57:50Z","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":"We consider a common type of symmetry where we have a matrix of decision variables with interchangeable rows and columns. A simple and efficient method to deal with such row and column symmetry is to post symmetry breaking constraints like DOUBLELEX and SNAKELEX. We provide a number of positive and negative results on posting such symmetry breaking constraints. On the positive side, we prove that we can compute in polynomial time a unique representative of an equivalence class in a matrix model with row and column symmetry if the number of rows (or of columns) is bounded and in a number of oth","authors_text":"George Katsirelos, Nina Narodytska, Toby Walsh","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-07-05T02:15:00Z","title":"On The Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0602","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:3d9743ce69fb7b9602d8418520fc9a8cf3f9a4c6e49ff00f67141837ff408e0f","target":"record","created_at":"2026-05-18T03:57:50Z","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":"e8d552413f167ad34267d1fae132a001b031a5434f8285417ab2a25657cd910d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-07-05T02:15:00Z","title_canon_sha256":"59add690924158822748271599a87270487ebe380884ca7ff4db90c2db0cd867"},"schema_version":"1.0","source":{"id":"1007.0602","kind":"arxiv","version":1}},"canonical_sha256":"f010bd8b874d3e3dbe7b5dd68c87a3b1498c44a293fe378f275475f0f769ab80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f010bd8b874d3e3dbe7b5dd68c87a3b1498c44a293fe378f275475f0f769ab80","first_computed_at":"2026-05-18T03:57:50.759795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:50.759795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YOSW9gllQ7UM4sF8DV8d9IlrAwS/dG5hsLLSkv0oW4H/QRJaIQOlAqayR5AcNAlVBahHxTGqPMAWUYaNyqsMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:50.760404Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.0602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d9743ce69fb7b9602d8418520fc9a8cf3f9a4c6e49ff00f67141837ff408e0f","sha256:23fd81d4c20b153ec4fa4357d3cb0bde46dc73bb089a69aa3c950800a82d26b3"],"state_sha256":"5356c6eacae53d6022553ac36900a6ef6c043dd1177174f60b08f234a65c8387"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APhoeLWZQpwb48Ij/3lYmQrfKMztBrL+WNVd1mBDNLHRn5OEkIwMGmlzpjKjm+ImEW9EMQqx1R8iWsiRG6fkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T21:10:31.769266Z","bundle_sha256":"bdc992e10307a0b8bbd67d310274c1c385fd8aa0dd35dda07848269a3f0bad29"}}