{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CPRRW4ZW2MYGU5ANO3IJJMSPRS","short_pith_number":"pith:CPRRW4ZW","canonical_record":{"source":{"id":"1503.04486","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-15T22:53:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bcb6047a33478ca522580f4d8384e6324aa78a2143e2ad7ec6ed788f7f343f21","abstract_canon_sha256":"ab86084c23e5494b8be02a913f8abd54e412c44962ed4113cbbce0b1928c9bdc"},"schema_version":"1.0"},"canonical_sha256":"13e31b7336d3306a740d76d094b24f8cad24eb584f70a7208ffed6e0dd2a4256","source":{"kind":"arxiv","id":"1503.04486","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04486","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04486v2","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04486","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"CPRRW4ZW2MYG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CPRRW4ZW2MYGU5AN","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CPRRW4ZW","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CPRRW4ZW2MYGU5ANO3IJJMSPRS","target":"record","payload":{"canonical_record":{"source":{"id":"1503.04486","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-15T22:53:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bcb6047a33478ca522580f4d8384e6324aa78a2143e2ad7ec6ed788f7f343f21","abstract_canon_sha256":"ab86084c23e5494b8be02a913f8abd54e412c44962ed4113cbbce0b1928c9bdc"},"schema_version":"1.0"},"canonical_sha256":"13e31b7336d3306a740d76d094b24f8cad24eb584f70a7208ffed6e0dd2a4256","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:41.130261Z","signature_b64":"LYIaYwAc2cDkM6dkd5JGYUi4hD+EbLNSlraz/yI0tb/PPofY8n+t1I068ZOPBSBZnyoQUEwSb6MgKCdzS0OECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13e31b7336d3306a740d76d094b24f8cad24eb584f70a7208ffed6e0dd2a4256","last_reissued_at":"2026-05-18T02:09:41.129587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:41.129587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.04486","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-18T02:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RAcZeg/FFeCcyjBLhEQcV0awbIItSiPDdjKKlvfM0yk6U/NHf2Plzfzh2tGRaBrzDlG/PV96ouDMtNLdarRNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:56:20.205925Z"},"content_sha256":"cbab2270224c0b05d6eb2a44cb596866d8236e36ed052f1c903861a2c609d3b1","schema_version":"1.0","event_id":"sha256:cbab2270224c0b05d6eb2a44cb596866d8236e36ed052f1c903861a2c609d3b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CPRRW4ZW2MYGU5ANO3IJJMSPRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of computing the minimum rank of a sign pattern matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Amey Bhangale, Swastik Kopparty","submitted_at":"2015-03-15T22:53:13Z","abstract_excerpt":"We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In fact, our hardness result shows that it is already hard to determine if the minimum rank of a sign pattern matrix is $\\leq 3$. We complement this by giving a polynomial time algorithm for determining if a given sign pattern matrix has minimum rank $\\leq 2$.\n  Our result answers one of the open problems from Linial et al. [Combinatorica, 27(4):439--463, 2007"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04486","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-18T02:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DnwZppEYx1Mlqg02HgwMsv5p3MXibl/uHP+3CQNPPWvrBy3GlERTr3H92Bu+HuTzQIE29GqwsVLzHl3WhTAmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:56:20.206271Z"},"content_sha256":"77ea6b91960d1830c327c3414cfda792a9d7c9a50a2b4f047751a10db8bb3ec6","schema_version":"1.0","event_id":"sha256:77ea6b91960d1830c327c3414cfda792a9d7c9a50a2b4f047751a10db8bb3ec6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPRRW4ZW2MYGU5ANO3IJJMSPRS/bundle.json","state_url":"https://pith.science/pith/CPRRW4ZW2MYGU5ANO3IJJMSPRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPRRW4ZW2MYGU5ANO3IJJMSPRS/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-20T09:56:20Z","links":{"resolver":"https://pith.science/pith/CPRRW4ZW2MYGU5ANO3IJJMSPRS","bundle":"https://pith.science/pith/CPRRW4ZW2MYGU5ANO3IJJMSPRS/bundle.json","state":"https://pith.science/pith/CPRRW4ZW2MYGU5ANO3IJJMSPRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPRRW4ZW2MYGU5ANO3IJJMSPRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CPRRW4ZW2MYGU5ANO3IJJMSPRS","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":"ab86084c23e5494b8be02a913f8abd54e412c44962ed4113cbbce0b1928c9bdc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-15T22:53:13Z","title_canon_sha256":"bcb6047a33478ca522580f4d8384e6324aa78a2143e2ad7ec6ed788f7f343f21"},"schema_version":"1.0","source":{"id":"1503.04486","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04486","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04486v2","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04486","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"CPRRW4ZW2MYG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CPRRW4ZW2MYGU5AN","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CPRRW4ZW","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:77ea6b91960d1830c327c3414cfda792a9d7c9a50a2b4f047751a10db8bb3ec6","target":"graph","created_at":"2026-05-18T02:09:41Z","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 show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In fact, our hardness result shows that it is already hard to determine if the minimum rank of a sign pattern matrix is $\\leq 3$. We complement this by giving a polynomial time algorithm for determining if a given sign pattern matrix has minimum rank $\\leq 2$.\n  Our result answers one of the open problems from Linial et al. [Combinatorica, 27(4):439--463, 2007","authors_text":"Amey Bhangale, Swastik Kopparty","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-15T22:53:13Z","title":"The complexity of computing the minimum rank of a sign pattern matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04486","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:cbab2270224c0b05d6eb2a44cb596866d8236e36ed052f1c903861a2c609d3b1","target":"record","created_at":"2026-05-18T02:09:41Z","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":"ab86084c23e5494b8be02a913f8abd54e412c44962ed4113cbbce0b1928c9bdc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-15T22:53:13Z","title_canon_sha256":"bcb6047a33478ca522580f4d8384e6324aa78a2143e2ad7ec6ed788f7f343f21"},"schema_version":"1.0","source":{"id":"1503.04486","kind":"arxiv","version":2}},"canonical_sha256":"13e31b7336d3306a740d76d094b24f8cad24eb584f70a7208ffed6e0dd2a4256","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13e31b7336d3306a740d76d094b24f8cad24eb584f70a7208ffed6e0dd2a4256","first_computed_at":"2026-05-18T02:09:41.129587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:09:41.129587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LYIaYwAc2cDkM6dkd5JGYUi4hD+EbLNSlraz/yI0tb/PPofY8n+t1I068ZOPBSBZnyoQUEwSb6MgKCdzS0OECA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:09:41.130261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04486","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbab2270224c0b05d6eb2a44cb596866d8236e36ed052f1c903861a2c609d3b1","sha256:77ea6b91960d1830c327c3414cfda792a9d7c9a50a2b4f047751a10db8bb3ec6"],"state_sha256":"2597b92bb9551eaacc94a38baa6adec27fa2683fb5b8ede07e7123172e554cd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05RJQcMmIxeVq5VQf4e3FlKms3PSd/mSNNXHlyXDhjiPCkR0mN5VFqsC8nQBW2b1Udf8HKvTNbnTRfVU1V8aCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:56:20.208227Z","bundle_sha256":"74fd20070045ee2a10e1ae912ab3c87b171372da2d55b20ea389dd6c38751a81"}}