{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IH5GU6RNXR4LO6U4WADGWOP2U5","short_pith_number":"pith:IH5GU6RN","schema_version":"1.0","canonical_sha256":"41fa6a7a2dbc78b77a9cb0066b39faa75e0ac119e517feead0cd4a836f3c028a","source":{"kind":"arxiv","id":"1303.5670","version":1},"attestation_state":"computed","paper":{"title":"Which Nonnegative Matrices Are Slack Matrices?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jo\\~ao Gouveia, Kanstantsin Pashkovich, Rekha R. Thomas, Richard Z. Robinson, Roland Grappe, Volker Kaibel","submitted_at":"2013-03-22T17:38:10Z","abstract_excerpt":"In this paper we characterize the slack matrices of cones and polytopes among all nonnegative matrices. This leads to an algorithm for deciding whether a given matrix is a slack matrix. The underlying decision problem is equivalent to the polyhedral verification problem whose complexity is unknown."},"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":"1303.5670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-22T17:38:10Z","cross_cats_sorted":[],"title_canon_sha256":"072faec6745410658274c0f334fab902f9f2238fe4aa56dd6069b8cdce1aac58","abstract_canon_sha256":"eb0323872bf69a7312f35b9f5fe712c81ccda32283b0fc04313cd46dcc116a5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:03.558285Z","signature_b64":"C8VmttON57DGYDJZnSvBToYfMQ4ELjZYo8217hfeBoAnjRCKwgWE7l2TyQ/xVA0hTP95nhRXdMfltYwC5k+vCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41fa6a7a2dbc78b77a9cb0066b39faa75e0ac119e517feead0cd4a836f3c028a","last_reissued_at":"2026-05-18T03:30:03.557748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:03.557748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Which Nonnegative Matrices Are Slack Matrices?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jo\\~ao Gouveia, Kanstantsin Pashkovich, Rekha R. Thomas, Richard Z. Robinson, Roland Grappe, Volker Kaibel","submitted_at":"2013-03-22T17:38:10Z","abstract_excerpt":"In this paper we characterize the slack matrices of cones and polytopes among all nonnegative matrices. This leads to an algorithm for deciding whether a given matrix is a slack matrix. The underlying decision problem is equivalent to the polyhedral verification problem whose complexity is unknown."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5670","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":"1303.5670","created_at":"2026-05-18T03:30:03.557826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5670v1","created_at":"2026-05-18T03:30:03.557826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5670","created_at":"2026-05-18T03:30:03.557826+00:00"},{"alias_kind":"pith_short_12","alias_value":"IH5GU6RNXR4L","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IH5GU6RNXR4LO6U4","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IH5GU6RN","created_at":"2026-05-18T12:27:46.883200+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/IH5GU6RNXR4LO6U4WADGWOP2U5","json":"https://pith.science/pith/IH5GU6RNXR4LO6U4WADGWOP2U5.json","graph_json":"https://pith.science/api/pith-number/IH5GU6RNXR4LO6U4WADGWOP2U5/graph.json","events_json":"https://pith.science/api/pith-number/IH5GU6RNXR4LO6U4WADGWOP2U5/events.json","paper":"https://pith.science/paper/IH5GU6RN"},"agent_actions":{"view_html":"https://pith.science/pith/IH5GU6RNXR4LO6U4WADGWOP2U5","download_json":"https://pith.science/pith/IH5GU6RNXR4LO6U4WADGWOP2U5.json","view_paper":"https://pith.science/paper/IH5GU6RN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5670&json=true","fetch_graph":"https://pith.science/api/pith-number/IH5GU6RNXR4LO6U4WADGWOP2U5/graph.json","fetch_events":"https://pith.science/api/pith-number/IH5GU6RNXR4LO6U4WADGWOP2U5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IH5GU6RNXR4LO6U4WADGWOP2U5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IH5GU6RNXR4LO6U4WADGWOP2U5/action/storage_attestation","attest_author":"https://pith.science/pith/IH5GU6RNXR4LO6U4WADGWOP2U5/action/author_attestation","sign_citation":"https://pith.science/pith/IH5GU6RNXR4LO6U4WADGWOP2U5/action/citation_signature","submit_replication":"https://pith.science/pith/IH5GU6RNXR4LO6U4WADGWOP2U5/action/replication_record"}},"created_at":"2026-05-18T03:30:03.557826+00:00","updated_at":"2026-05-18T03:30:03.557826+00:00"}